./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:13:33,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:13:33,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:13:33,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:13:33,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:13:33,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:13:33,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:13:33,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:13:33,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:13:33,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:13:33,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:13:33,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:13:33,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:13:33,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:13:33,319 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:13:33,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:13:33,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:13:33,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:13:33,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:13:33,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:13:33,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:13:33,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:13:33,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:13:33,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:13:33,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:33,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:13:33,322 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 [2025-03-08 16:13:33,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:13:33,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:13:33,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:13:33,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:13:33,576 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:13:33,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2025-03-08 16:13:34,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed110047b/8e36de97172b499cb63ebf8de2a0c4be/FLAG2b1047637 [2025-03-08 16:13:34,989 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:13:34,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2025-03-08 16:13:34,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed110047b/8e36de97172b499cb63ebf8de2a0c4be/FLAG2b1047637 [2025-03-08 16:13:35,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed110047b/8e36de97172b499cb63ebf8de2a0c4be [2025-03-08 16:13:35,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:13:35,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:13:35,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:35,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:13:35,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:13:35,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35, skipping insertion in model container [2025-03-08 16:13:35,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:13:35,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2025-03-08 16:13:35,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:35,525 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:13:35,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2025-03-08 16:13:35,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:35,577 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:13:35,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35 WrapperNode [2025-03-08 16:13:35,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:35,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:35,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:13:35,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:13:35,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,618 INFO L138 Inliner]: procedures = 29, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2025-03-08 16:13:35,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:35,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:13:35,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:13:35,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:13:35,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,646 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2025-03-08 16:13:35,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:13:35,679 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:13:35,679 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:13:35,679 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:13:35,680 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (1/1) ... [2025-03-08 16:13:35,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:35,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:35,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:13:35,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:13:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:13:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:13:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:13:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:13:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:13:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:13:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:13:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:13:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:13:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:13:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:13:35,851 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:13:35,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:13:36,239 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1; [2025-03-08 16:13:36,285 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-08 16:13:36,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:13:36,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:13:36,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:13:36,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:13:36 BoogieIcfgContainer [2025-03-08 16:13:36,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:13:36,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:13:36,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:13:36,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:13:36,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:13:35" (1/3) ... [2025-03-08 16:13:36,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5954ce6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:13:36, skipping insertion in model container [2025-03-08 16:13:36,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:35" (2/3) ... [2025-03-08 16:13:36,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5954ce6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:13:36, skipping insertion in model container [2025-03-08 16:13:36,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:13:36" (3/3) ... [2025-03-08 16:13:36,305 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-13.i [2025-03-08 16:13:36,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:13:36,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:13:36,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:13:36,359 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;@7ec6e19a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:13:36,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:13:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:13:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:13:36,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:36,369 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:36,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:36,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash 857864655, now seen corresponding path program 1 times [2025-03-08 16:13:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:36,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526775245] [2025-03-08 16:13:36,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:36,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:13:36,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:13:36,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:36,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:13:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526775245] [2025-03-08 16:13:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526775245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064395757] [2025-03-08 16:13:36,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:36,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:36,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:36,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:13:36,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:13:36,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:13:36,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:36,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:36,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:13:36,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:13:36,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064395757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:36,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:13:36,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:13:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21760042] [2025-03-08 16:13:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:36,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:13:36,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:36,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:13:36,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:13:36,857 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:36,873 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-03-08 16:13:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:13:36,875 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-08 16:13:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:36,881 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:13:36,882 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:13:36,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:13:36,887 INFO L435 NwaCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:36,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:13:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:13:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:13:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-03-08 16:13:36,921 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-03-08 16:13:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:36,923 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-03-08 16:13:36,923 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-03-08 16:13:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:13:36,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:36,928 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:36,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:13:37,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:13:37,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:37,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash 428592868, now seen corresponding path program 1 times [2025-03-08 16:13:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:37,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916068925] [2025-03-08 16:13:37,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:37,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:37,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:13:37,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:13:37,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:37,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:37,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916068925] [2025-03-08 16:13:37,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916068925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:37,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:37,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:13:37,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326317507] [2025-03-08 16:13:37,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:37,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:13:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:37,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:13:37,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:13:37,433 INFO L87 Difference]: Start difference. First operand 108 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:37,475 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2025-03-08 16:13:37,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:13:37,476 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-08 16:13:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:37,477 INFO L225 Difference]: With dead ends: 215 [2025-03-08 16:13:37,477 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 16:13:37,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:13:37,478 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:37,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 16:13:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 16:13:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:13:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-03-08 16:13:37,490 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2025-03-08 16:13:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:37,493 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-03-08 16:13:37,494 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-03-08 16:13:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:13:37,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:37,495 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:37,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:13:37,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1425752669, now seen corresponding path program 1 times [2025-03-08 16:13:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:37,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162831454] [2025-03-08 16:13:37,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:37,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:37,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:13:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:13:37,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:37,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:13:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162831454] [2025-03-08 16:13:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162831454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773239364] [2025-03-08 16:13:37,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:37,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:37,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:37,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:37,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:13:37,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:13:37,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:13:37,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:37,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:37,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:13:37,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:37,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773239364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:37,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:13:37,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 16:13:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405764151] [2025-03-08 16:13:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:37,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:13:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:37,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:13:37,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:37,913 INFO L87 Difference]: Start difference. First operand 110 states and 161 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:37,948 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2025-03-08 16:13:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:13:37,949 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:13:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:37,951 INFO L225 Difference]: With dead ends: 219 [2025-03-08 16:13:37,953 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:13:37,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:37,954 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:37,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:13:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 16:13:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:13:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2025-03-08 16:13:37,965 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 131 [2025-03-08 16:13:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:37,965 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2025-03-08 16:13:37,965 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2025-03-08 16:13:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:13:37,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:37,966 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:37,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:38,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 16:13:38,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:38,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 56129601, now seen corresponding path program 1 times [2025-03-08 16:13:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:38,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789258082] [2025-03-08 16:13:38,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:38,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:13:38,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:13:38,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:38,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:38,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789258082] [2025-03-08 16:13:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789258082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:38,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:13:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581605639] [2025-03-08 16:13:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:38,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:13:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:38,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:13:38,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:13:38,437 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:38,448 INFO L93 Difference]: Finished difference Result 221 states and 323 transitions. [2025-03-08 16:13:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:13:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-03-08 16:13:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:38,449 INFO L225 Difference]: With dead ends: 221 [2025-03-08 16:13:38,450 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:13:38,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:13:38,450 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:38,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:13:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 16:13:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:13:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2025-03-08 16:13:38,459 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 133 [2025-03-08 16:13:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:38,459 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2025-03-08 16:13:38,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2025-03-08 16:13:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:13:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:38,460 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:38,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:13:38,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:38,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 185212320, now seen corresponding path program 1 times [2025-03-08 16:13:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298022207] [2025-03-08 16:13:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:38,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:13:38,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:13:38,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:38,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298022207] [2025-03-08 16:13:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298022207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:38,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014062683] [2025-03-08 16:13:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:38,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:38,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:38,931 INFO L87 Difference]: Start difference. First operand 112 states and 162 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:38,996 INFO L93 Difference]: Finished difference Result 263 states and 382 transitions. [2025-03-08 16:13:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:38,997 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-08 16:13:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:38,998 INFO L225 Difference]: With dead ends: 263 [2025-03-08 16:13:38,998 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 16:13:38,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:38,999 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 104 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:38,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 594 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 16:13:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2025-03-08 16:13:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:13:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2025-03-08 16:13:39,005 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 133 [2025-03-08 16:13:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:39,006 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2025-03-08 16:13:39,006 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2025-03-08 16:13:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:13:39,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:39,008 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:13:39,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1994814050, now seen corresponding path program 1 times [2025-03-08 16:13:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050068517] [2025-03-08 16:13:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:39,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:13:39,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:13:39,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:39,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050068517] [2025-03-08 16:13:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050068517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:39,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:39,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837682812] [2025-03-08 16:13:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:39,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:39,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:39,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:39,442 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:39,567 INFO L93 Difference]: Finished difference Result 349 states and 508 transitions. [2025-03-08 16:13:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:39,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-08 16:13:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:39,570 INFO L225 Difference]: With dead ends: 349 [2025-03-08 16:13:39,570 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 16:13:39,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:39,571 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 115 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:39,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 942 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 16:13:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2025-03-08 16:13:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 196 states have (on average 1.4081632653061225) internal successors, (276), 197 states have internal predecessors, (276), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:13:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 326 transitions. [2025-03-08 16:13:39,591 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 326 transitions. Word has length 134 [2025-03-08 16:13:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:39,591 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 326 transitions. [2025-03-08 16:13:39,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 326 transitions. [2025-03-08 16:13:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:13:39,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:39,592 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:39,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:13:39,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:39,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2103639741, now seen corresponding path program 1 times [2025-03-08 16:13:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:39,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558557747] [2025-03-08 16:13:39,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:39,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:13:39,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:13:39,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:39,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:13:40,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:40,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558557747] [2025-03-08 16:13:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558557747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:13:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130436729] [2025-03-08 16:13:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:40,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:13:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:40,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:13:40,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:13:40,470 INFO L87 Difference]: Start difference. First operand 224 states and 326 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:42,429 INFO L93 Difference]: Finished difference Result 570 states and 822 transitions. [2025-03-08 16:13:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:13:42,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-08 16:13:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:42,433 INFO L225 Difference]: With dead ends: 570 [2025-03-08 16:13:42,433 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 16:13:42,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:13:42,438 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 459 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:42,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 849 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 16:13:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 16:13:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 338. [2025-03-08 16:13:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.3966101694915254) internal successors, (412), 297 states have internal predecessors, (412), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 16:13:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 486 transitions. [2025-03-08 16:13:42,468 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 486 transitions. Word has length 134 [2025-03-08 16:13:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:42,469 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 486 transitions. [2025-03-08 16:13:42,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 486 transitions. [2025-03-08 16:13:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:13:42,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:42,470 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:42,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:13:42,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:42,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1891329021, now seen corresponding path program 1 times [2025-03-08 16:13:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337440688] [2025-03-08 16:13:42,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:42,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:13:42,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:13:42,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:42,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:42,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337440688] [2025-03-08 16:13:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337440688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:42,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:42,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:42,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487344125] [2025-03-08 16:13:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:42,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:42,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:42,987 INFO L87 Difference]: Start difference. First operand 338 states and 486 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:43,211 INFO L93 Difference]: Finished difference Result 684 states and 980 transitions. [2025-03-08 16:13:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-08 16:13:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:43,214 INFO L225 Difference]: With dead ends: 684 [2025-03-08 16:13:43,214 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 16:13:43,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:43,215 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 218 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:43,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 608 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 16:13:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 267. [2025-03-08 16:13:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 235 states have (on average 1.4) internal successors, (329), 236 states have internal predecessors, (329), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:13:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 383 transitions. [2025-03-08 16:13:43,240 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 383 transitions. Word has length 134 [2025-03-08 16:13:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:43,240 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 383 transitions. [2025-03-08 16:13:43,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 383 transitions. [2025-03-08 16:13:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:13:43,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:43,242 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:43,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:13:43,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:43,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1694815516, now seen corresponding path program 1 times [2025-03-08 16:13:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799479777] [2025-03-08 16:13:43,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:43,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:13:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:13:43,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799479777] [2025-03-08 16:13:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799479777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407329644] [2025-03-08 16:13:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:43,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:43,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:43,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:43,420 INFO L87 Difference]: Start difference. First operand 267 states and 383 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:43,553 INFO L93 Difference]: Finished difference Result 613 states and 880 transitions. [2025-03-08 16:13:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-08 16:13:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:43,555 INFO L225 Difference]: With dead ends: 613 [2025-03-08 16:13:43,556 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 16:13:43,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:43,557 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 144 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:43,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1205 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 16:13:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 270. [2025-03-08 16:13:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.3949579831932772) internal successors, (332), 239 states have internal predecessors, (332), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:13:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 386 transitions. [2025-03-08 16:13:43,584 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 386 transitions. Word has length 134 [2025-03-08 16:13:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 386 transitions. [2025-03-08 16:13:43,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 386 transitions. [2025-03-08 16:13:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:13:43,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:43,588 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:43,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:13:43,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:43,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash 94377662, now seen corresponding path program 1 times [2025-03-08 16:13:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142180898] [2025-03-08 16:13:43,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:43,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:13:43,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:13:43,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:43,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:43,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142180898] [2025-03-08 16:13:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142180898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:43,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:43,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:13:43,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150822411] [2025-03-08 16:13:43,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:43,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:13:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:43,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:13:43,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:13:43,766 INFO L87 Difference]: Start difference. First operand 270 states and 386 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:43,835 INFO L93 Difference]: Finished difference Result 754 states and 1077 transitions. [2025-03-08 16:13:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:13:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-08 16:13:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:43,837 INFO L225 Difference]: With dead ends: 754 [2025-03-08 16:13:43,837 INFO L226 Difference]: Without dead ends: 487 [2025-03-08 16:13:43,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:43,838 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 88 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:43,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 428 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-08 16:13:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 483. [2025-03-08 16:13:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 420 states have (on average 1.3785714285714286) internal successors, (579), 422 states have internal predecessors, (579), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:13:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 687 transitions. [2025-03-08 16:13:43,879 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 687 transitions. Word has length 134 [2025-03-08 16:13:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:43,879 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 687 transitions. [2025-03-08 16:13:43,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 687 transitions. [2025-03-08 16:13:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:13:43,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:43,881 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:43,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:13:43,881 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1979976642, now seen corresponding path program 1 times [2025-03-08 16:13:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:43,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547332823] [2025-03-08 16:13:43,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:43,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:13:43,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:13:43,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:43,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547332823] [2025-03-08 16:13:44,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547332823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:44,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:13:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078036922] [2025-03-08 16:13:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:44,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:13:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:44,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:13:44,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:13:44,015 INFO L87 Difference]: Start difference. First operand 483 states and 687 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:44,079 INFO L93 Difference]: Finished difference Result 949 states and 1349 transitions. [2025-03-08 16:13:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:13:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-08 16:13:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:44,082 INFO L225 Difference]: With dead ends: 949 [2025-03-08 16:13:44,082 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 16:13:44,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:44,083 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 96 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:44,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 457 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 16:13:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2025-03-08 16:13:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.373134328358209) internal successors, (552), 404 states have internal predecessors, (552), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:13:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 660 transitions. [2025-03-08 16:13:44,123 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 660 transitions. Word has length 134 [2025-03-08 16:13:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:44,123 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 660 transitions. [2025-03-08 16:13:44,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 660 transitions. [2025-03-08 16:13:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:13:44,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:44,124 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:44,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:13:44,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:44,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1601943810, now seen corresponding path program 1 times [2025-03-08 16:13:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146655042] [2025-03-08 16:13:44,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:44,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:13:44,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:13:44,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:44,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:44,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:44,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146655042] [2025-03-08 16:13:44,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146655042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:44,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:44,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799744378] [2025-03-08 16:13:44,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:44,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:44,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:44,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:44,380 INFO L87 Difference]: Start difference. First operand 465 states and 660 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:44,467 INFO L93 Difference]: Finished difference Result 980 states and 1385 transitions. [2025-03-08 16:13:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:44,468 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-08 16:13:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:44,470 INFO L225 Difference]: With dead ends: 980 [2025-03-08 16:13:44,470 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 16:13:44,471 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-03-08 16:13:44,471 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 58 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:44,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 833 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 16:13:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 449. [2025-03-08 16:13:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 386 states have (on average 1.339378238341969) internal successors, (517), 388 states have internal predecessors, (517), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:13:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 625 transitions. [2025-03-08 16:13:44,500 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 625 transitions. Word has length 135 [2025-03-08 16:13:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:44,501 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 625 transitions. [2025-03-08 16:13:44,501 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 625 transitions. [2025-03-08 16:13:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:13:44,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:44,502 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:44,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:13:44,502 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:44,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1339713789, now seen corresponding path program 1 times [2025-03-08 16:13:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968920341] [2025-03-08 16:13:44,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:44,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:13:44,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:13:44,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:44,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968920341] [2025-03-08 16:13:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968920341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:44,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:44,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:13:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810307561] [2025-03-08 16:13:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:44,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:13:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:44,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:13:44,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:13:44,597 INFO L87 Difference]: Start difference. First operand 449 states and 625 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:44,624 INFO L93 Difference]: Finished difference Result 704 states and 981 transitions. [2025-03-08 16:13:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:13:44,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:13:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:44,626 INFO L225 Difference]: With dead ends: 704 [2025-03-08 16:13:44,626 INFO L226 Difference]: Without dead ends: 449 [2025-03-08 16:13:44,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:13:44,627 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:44,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-08 16:13:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2025-03-08 16:13:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 386 states have (on average 1.3367875647668395) internal successors, (516), 388 states have internal predecessors, (516), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:13:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 624 transitions. [2025-03-08 16:13:44,657 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 624 transitions. Word has length 135 [2025-03-08 16:13:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:44,657 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 624 transitions. [2025-03-08 16:13:44,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 624 transitions. [2025-03-08 16:13:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:13:44,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:44,658 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:44,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:13:44,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:44,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:44,659 INFO L85 PathProgramCache]: Analyzing trace with hash -94949308, now seen corresponding path program 1 times [2025-03-08 16:13:44,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:44,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314721150] [2025-03-08 16:13:44,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:44,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:44,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:13:44,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:13:44,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:44,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:45,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:45,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314721150] [2025-03-08 16:13:45,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314721150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:45,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:13:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164801951] [2025-03-08 16:13:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:45,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:13:45,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:45,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:13:45,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:13:45,117 INFO L87 Difference]: Start difference. First operand 449 states and 624 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:45,508 INFO L93 Difference]: Finished difference Result 1365 states and 1900 transitions. [2025-03-08 16:13:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:13:45,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:13:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:45,513 INFO L225 Difference]: With dead ends: 1365 [2025-03-08 16:13:45,513 INFO L226 Difference]: Without dead ends: 1110 [2025-03-08 16:13:45,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:13:45,514 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 353 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:45,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1709 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:13:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-03-08 16:13:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 887. [2025-03-08 16:13:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 762 states have (on average 1.337270341207349) internal successors, (1019), 766 states have internal predecessors, (1019), 108 states have call successors, (108), 16 states have call predecessors, (108), 16 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 16:13:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1235 transitions. [2025-03-08 16:13:45,569 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1235 transitions. Word has length 135 [2025-03-08 16:13:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:45,569 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1235 transitions. [2025-03-08 16:13:45,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1235 transitions. [2025-03-08 16:13:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:13:45,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:45,571 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:45,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:13:45,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:45,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash -63929501, now seen corresponding path program 1 times [2025-03-08 16:13:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908619670] [2025-03-08 16:13:45,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:45,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:13:45,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:13:45,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:45,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908619670] [2025-03-08 16:13:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908619670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:45,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:45,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:45,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870727863] [2025-03-08 16:13:45,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:45,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:45,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:45,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:45,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:45,824 INFO L87 Difference]: Start difference. First operand 887 states and 1235 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:46,129 INFO L93 Difference]: Finished difference Result 1385 states and 1921 transitions. [2025-03-08 16:13:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:13:46,130 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:13:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:46,136 INFO L225 Difference]: With dead ends: 1385 [2025-03-08 16:13:46,136 INFO L226 Difference]: Without dead ends: 883 [2025-03-08 16:13:46,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:13:46,138 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 365 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:46,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1306 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-08 16:13:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 873. [2025-03-08 16:13:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 743 states have (on average 1.3243606998654105) internal successors, (984), 746 states have internal predecessors, (984), 111 states have call successors, (111), 18 states have call predecessors, (111), 18 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-08 16:13:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1206 transitions. [2025-03-08 16:13:46,204 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1206 transitions. Word has length 135 [2025-03-08 16:13:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:46,205 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1206 transitions. [2025-03-08 16:13:46,205 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1206 transitions. [2025-03-08 16:13:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:13:46,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:46,207 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:46,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:13:46,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:46,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash -472753726, now seen corresponding path program 1 times [2025-03-08 16:13:46,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:46,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166633533] [2025-03-08 16:13:46,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:46,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:46,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:13:46,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:13:46,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:46,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:46,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166633533] [2025-03-08 16:13:46,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166633533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:46,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:46,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:13:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938232022] [2025-03-08 16:13:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:46,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:13:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:46,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:13:46,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:46,497 INFO L87 Difference]: Start difference. First operand 873 states and 1206 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:46,905 INFO L93 Difference]: Finished difference Result 1373 states and 1887 transitions. [2025-03-08 16:13:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:13:46,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:13:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:46,909 INFO L225 Difference]: With dead ends: 1373 [2025-03-08 16:13:46,909 INFO L226 Difference]: Without dead ends: 885 [2025-03-08 16:13:46,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:13:46,911 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 245 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:46,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1673 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:13:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-08 16:13:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 871. [2025-03-08 16:13:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 741 states have (on average 1.3238866396761133) internal successors, (981), 744 states have internal predecessors, (981), 111 states have call successors, (111), 18 states have call predecessors, (111), 18 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-08 16:13:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1203 transitions. [2025-03-08 16:13:46,967 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1203 transitions. Word has length 135 [2025-03-08 16:13:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:46,967 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1203 transitions. [2025-03-08 16:13:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1203 transitions. [2025-03-08 16:13:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:13:46,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:46,968 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:46,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:13:46,968 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:46,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -698214, now seen corresponding path program 1 times [2025-03-08 16:13:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:46,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410357372] [2025-03-08 16:13:46,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:46,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:13:46,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:13:46,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:46,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410357372] [2025-03-08 16:13:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410357372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:47,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:47,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195183608] [2025-03-08 16:13:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:47,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:47,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:47,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:47,202 INFO L87 Difference]: Start difference. First operand 871 states and 1203 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:47,467 INFO L93 Difference]: Finished difference Result 1122 states and 1546 transitions. [2025-03-08 16:13:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:13:47,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-03-08 16:13:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:47,471 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 16:13:47,471 INFO L226 Difference]: Without dead ends: 873 [2025-03-08 16:13:47,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:13:47,472 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 323 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:47,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1225 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-08 16:13:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 867. [2025-03-08 16:13:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 737 states have (on average 1.3202170963364994) internal successors, (973), 740 states have internal predecessors, (973), 111 states have call successors, (111), 18 states have call predecessors, (111), 18 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-08 16:13:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1195 transitions. [2025-03-08 16:13:47,520 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1195 transitions. Word has length 136 [2025-03-08 16:13:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:47,520 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1195 transitions. [2025-03-08 16:13:47,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1195 transitions. [2025-03-08 16:13:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:13:47,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:47,522 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:47,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:13:47,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2075052518, now seen corresponding path program 1 times [2025-03-08 16:13:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144838309] [2025-03-08 16:13:47,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:47,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:13:47,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:13:47,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:47,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144838309] [2025-03-08 16:13:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144838309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300489158] [2025-03-08 16:13:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:47,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:47,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:47,736 INFO L87 Difference]: Start difference. First operand 867 states and 1195 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:48,023 INFO L93 Difference]: Finished difference Result 1091 states and 1500 transitions. [2025-03-08 16:13:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:13:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-03-08 16:13:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:48,027 INFO L225 Difference]: With dead ends: 1091 [2025-03-08 16:13:48,028 INFO L226 Difference]: Without dead ends: 846 [2025-03-08 16:13:48,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:13:48,029 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 259 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:48,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1636 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-08 16:13:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 649. [2025-03-08 16:13:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 550 states have (on average 1.3163636363636364) internal successors, (724), 552 states have internal predecessors, (724), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:13:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 892 transitions. [2025-03-08 16:13:48,067 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 892 transitions. Word has length 136 [2025-03-08 16:13:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:48,068 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 892 transitions. [2025-03-08 16:13:48,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 892 transitions. [2025-03-08 16:13:48,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:13:48,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:48,070 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:48,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:13:48,070 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:48,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1113438501, now seen corresponding path program 1 times [2025-03-08 16:13:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143107935] [2025-03-08 16:13:48,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:13:48,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:13:48,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:48,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143107935] [2025-03-08 16:13:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143107935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:48,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585672471] [2025-03-08 16:13:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:48,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:48,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:48,311 INFO L87 Difference]: Start difference. First operand 649 states and 892 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:48,391 INFO L93 Difference]: Finished difference Result 1193 states and 1633 transitions. [2025-03-08 16:13:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:48,392 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-08 16:13:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:48,395 INFO L225 Difference]: With dead ends: 1193 [2025-03-08 16:13:48,395 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 16:13:48,396 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-03-08 16:13:48,397 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 51 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 831 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-03-08 16:13:48,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 831 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 16:13:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 649. [2025-03-08 16:13:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 550 states have (on average 1.3109090909090908) internal successors, (721), 552 states have internal predecessors, (721), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:13:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 889 transitions. [2025-03-08 16:13:48,436 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 889 transitions. Word has length 136 [2025-03-08 16:13:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:48,437 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 889 transitions. [2025-03-08 16:13:48,437 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 889 transitions. [2025-03-08 16:13:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:13:48,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:48,438 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:48,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:13:48,438 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:48,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1133643202, now seen corresponding path program 1 times [2025-03-08 16:13:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:48,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934380799] [2025-03-08 16:13:48,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:48,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:48,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:13:48,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:13:48,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:48,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934380799] [2025-03-08 16:13:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934380799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:13:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690562268] [2025-03-08 16:13:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:13:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:48,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:13:48,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:48,592 INFO L87 Difference]: Start difference. First operand 649 states and 889 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:48,734 INFO L93 Difference]: Finished difference Result 1102 states and 1502 transitions. [2025-03-08 16:13:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:13:48,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-03-08 16:13:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:48,738 INFO L225 Difference]: With dead ends: 1102 [2025-03-08 16:13:48,738 INFO L226 Difference]: Without dead ends: 647 [2025-03-08 16:13:48,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:48,739 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 230 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:48,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 682 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-08 16:13:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 641. [2025-03-08 16:13:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 542 states have (on average 1.3044280442804428) internal successors, (707), 544 states have internal predecessors, (707), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:13:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 875 transitions. [2025-03-08 16:13:48,779 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 875 transitions. Word has length 138 [2025-03-08 16:13:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:48,779 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 875 transitions. [2025-03-08 16:13:48,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 875 transitions. [2025-03-08 16:13:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:13:48,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:48,781 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:48,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:13:48,781 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:48,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash -97705732, now seen corresponding path program 1 times [2025-03-08 16:13:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:48,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049540958] [2025-03-08 16:13:48,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:48,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:13:48,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:13:48,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:48,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:13:48,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:48,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049540958] [2025-03-08 16:13:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049540958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:48,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135053383] [2025-03-08 16:13:48,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:48,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:48,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:48,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:13:49,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:13:49,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:13:49,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:49,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:49,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:13:49,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:49,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135053383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:13:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:13:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725066081] [2025-03-08 16:13:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:49,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:49,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:13:49,107 INFO L87 Difference]: Start difference. First operand 641 states and 875 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:49,159 INFO L93 Difference]: Finished difference Result 1303 states and 1777 transitions. [2025-03-08 16:13:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:49,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-03-08 16:13:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:49,162 INFO L225 Difference]: With dead ends: 1303 [2025-03-08 16:13:49,162 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 16:13:49,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:13:49,164 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:49,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 716 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 16:13:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-03-08 16:13:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 566 states have (on average 1.2915194346289753) internal successors, (731), 568 states have internal predecessors, (731), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:13:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 899 transitions. [2025-03-08 16:13:49,200 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 899 transitions. Word has length 139 [2025-03-08 16:13:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:49,201 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 899 transitions. [2025-03-08 16:13:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 899 transitions. [2025-03-08 16:13:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:13:49,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:49,202 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:49,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:49,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:49,403 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1598581908, now seen corresponding path program 1 times [2025-03-08 16:13:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404013446] [2025-03-08 16:13:49,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:49,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:13:49,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:13:49,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:49,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:49,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404013446] [2025-03-08 16:13:49,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404013446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:49,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:13:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755620760] [2025-03-08 16:13:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:49,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:13:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:49,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:13:49,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:13:49,525 INFO L87 Difference]: Start difference. First operand 665 states and 899 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:49,560 INFO L93 Difference]: Finished difference Result 1315 states and 1777 transitions. [2025-03-08 16:13:49,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:13:49,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-03-08 16:13:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:49,563 INFO L225 Difference]: With dead ends: 1315 [2025-03-08 16:13:49,563 INFO L226 Difference]: Without dead ends: 653 [2025-03-08 16:13:49,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:13:49,566 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:49,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-08 16:13:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-08 16:13:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 554 states have (on average 1.2761732851985559) internal successors, (707), 556 states have internal predecessors, (707), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:13:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 875 transitions. [2025-03-08 16:13:49,602 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 875 transitions. Word has length 139 [2025-03-08 16:13:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:49,603 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 875 transitions. [2025-03-08 16:13:49,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 875 transitions. [2025-03-08 16:13:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:13:49,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:49,604 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:49,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:13:49,604 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:49,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:49,605 INFO L85 PathProgramCache]: Analyzing trace with hash -412831174, now seen corresponding path program 1 times [2025-03-08 16:13:49,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:49,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826734316] [2025-03-08 16:13:49,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:49,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:13:49,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:13:49,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:49,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826734316] [2025-03-08 16:13:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826734316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:49,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:49,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437575135] [2025-03-08 16:13:49,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:49,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:49,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:49,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:49,849 INFO L87 Difference]: Start difference. First operand 653 states and 875 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:50,142 INFO L93 Difference]: Finished difference Result 1185 states and 1583 transitions. [2025-03-08 16:13:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-03-08 16:13:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:50,147 INFO L225 Difference]: With dead ends: 1185 [2025-03-08 16:13:50,147 INFO L226 Difference]: Without dead ends: 854 [2025-03-08 16:13:50,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:13:50,149 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 280 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:50,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1152 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-08 16:13:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 847. [2025-03-08 16:13:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 727 states have (on average 1.2764786795048142) internal successors, (928), 732 states have internal predecessors, (928), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 16:13:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1132 transitions. [2025-03-08 16:13:50,193 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1132 transitions. Word has length 141 [2025-03-08 16:13:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:50,193 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1132 transitions. [2025-03-08 16:13:50,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1132 transitions. [2025-03-08 16:13:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:13:50,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:50,195 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:50,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:13:50,195 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:50,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1872032281, now seen corresponding path program 1 times [2025-03-08 16:13:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:50,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472963398] [2025-03-08 16:13:50,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:50,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:50,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:13:50,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:13:50,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:50,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472963398] [2025-03-08 16:13:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472963398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839327923] [2025-03-08 16:13:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:50,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:50,372 INFO L87 Difference]: Start difference. First operand 847 states and 1132 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:50,575 INFO L93 Difference]: Finished difference Result 1888 states and 2522 transitions. [2025-03-08 16:13:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-03-08 16:13:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:50,580 INFO L225 Difference]: With dead ends: 1888 [2025-03-08 16:13:50,580 INFO L226 Difference]: Without dead ends: 1044 [2025-03-08 16:13:50,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:50,582 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 187 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:50,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 867 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-03-08 16:13:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1037. [2025-03-08 16:13:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 896 states have (on average 1.2779017857142858) internal successors, (1145), 904 states have internal predecessors, (1145), 120 states have call successors, (120), 20 states have call predecessors, (120), 20 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 16:13:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1385 transitions. [2025-03-08 16:13:50,658 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1385 transitions. Word has length 141 [2025-03-08 16:13:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:50,659 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1385 transitions. [2025-03-08 16:13:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1385 transitions. [2025-03-08 16:13:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:13:50,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:50,660 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:50,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:13:50,660 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1102519760, now seen corresponding path program 1 times [2025-03-08 16:13:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914142250] [2025-03-08 16:13:50,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:50,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:13:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:13:50,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:50,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:13:50,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914142250] [2025-03-08 16:13:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914142250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:50,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5087626] [2025-03-08 16:13:50,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:50,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:50,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:50,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:50,897 INFO L87 Difference]: Start difference. First operand 1037 states and 1385 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:51,023 INFO L93 Difference]: Finished difference Result 1074 states and 1429 transitions. [2025-03-08 16:13:51,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:13:51,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2025-03-08 16:13:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:51,028 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 16:13:51,029 INFO L226 Difference]: Without dead ends: 1072 [2025-03-08 16:13:51,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:13:51,031 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 120 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:51,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1234 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-08 16:13:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1070. [2025-03-08 16:13:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 929 states have (on average 1.2648008611410118) internal successors, (1175), 937 states have internal predecessors, (1175), 120 states have call successors, (120), 20 states have call predecessors, (120), 20 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 16:13:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1415 transitions. [2025-03-08 16:13:51,107 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1415 transitions. Word has length 142 [2025-03-08 16:13:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:51,107 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1415 transitions. [2025-03-08 16:13:51,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:13:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1415 transitions. [2025-03-08 16:13:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:13:51,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:51,110 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:51,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:13:51,110 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:51,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1008770609, now seen corresponding path program 1 times [2025-03-08 16:13:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897270935] [2025-03-08 16:13:51,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:51,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:13:51,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:13:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:13:51,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143458601] [2025-03-08 16:13:51,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:51,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:51,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:51,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:51,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:13:51,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:13:51,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:13:51,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:51,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:51,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 16:13:51,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:51,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2025-03-08 16:13:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:13:51,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897270935] [2025-03-08 16:13:51,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:13:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143458601] [2025-03-08 16:13:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143458601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:51,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205920283] [2025-03-08 16:13:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:13:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:51,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:13:51,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:51,600 INFO L87 Difference]: Start difference. First operand 1070 states and 1415 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:51,858 INFO L93 Difference]: Finished difference Result 1991 states and 2627 transitions. [2025-03-08 16:13:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:13:51,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-03-08 16:13:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:51,862 INFO L225 Difference]: With dead ends: 1991 [2025-03-08 16:13:51,862 INFO L226 Difference]: Without dead ends: 924 [2025-03-08 16:13:51,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:13:51,864 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 193 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:51,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 667 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-08 16:13:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 910. [2025-03-08 16:13:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 790 states have (on average 1.2620253164556963) internal successors, (997), 796 states have internal predecessors, (997), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 16:13:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1201 transitions. [2025-03-08 16:13:51,914 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1201 transitions. Word has length 142 [2025-03-08 16:13:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:51,914 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1201 transitions. [2025-03-08 16:13:51,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:13:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1201 transitions. [2025-03-08 16:13:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:13:51,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:51,919 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:13:51,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:13:52,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 16:13:52,119 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:52,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash -243038289, now seen corresponding path program 1 times [2025-03-08 16:13:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:52,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078973806] [2025-03-08 16:13:52,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:52,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:52,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:13:52,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:13:52,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:13:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574761863] [2025-03-08 16:13:52,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:52,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:52,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:52,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:13:52,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:13:52,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:13:52,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:13:52,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:13:52,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:13:52,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:13:52,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:13:52,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:13:52,649 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:13:52,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:13:52,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:52,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 16:13:52,853 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] [2025-03-08 16:13:52,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:13:52,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:13:52 BoogieIcfgContainer [2025-03-08 16:13:52,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:13:52,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:13:52,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:13:52,925 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:13:52,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:13:36" (3/4) ... [2025-03-08 16:13:52,929 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:13:52,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:13:52,930 INFO L158 Benchmark]: Toolchain (without parser) took 17596.99ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 104.8MB in the beginning and 211.4MB in the end (delta: -106.6MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. [2025-03-08 16:13:52,930 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:13:52,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.88ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 88.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:13:52,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.77ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 85.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:13:52,931 INFO L158 Benchmark]: Boogie Preprocessor took 59.16ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 81.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:13:52,931 INFO L158 Benchmark]: IcfgBuilder took 618.10ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 49.9MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:13:52,931 INFO L158 Benchmark]: TraceAbstraction took 16625.06ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 48.9MB in the beginning and 211.6MB in the end (delta: -162.7MB). Peak memory consumption was 237.8MB. Max. memory is 16.1GB. [2025-03-08 16:13:52,931 INFO L158 Benchmark]: Witness Printer took 4.65ms. Allocated memory is still 545.3MB. Free memory was 211.6MB in the beginning and 211.4MB in the end (delta: 175.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:13:52,932 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.59ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.88ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 88.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.77ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 85.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.16ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 81.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 618.10ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 49.9MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16625.06ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 48.9MB in the beginning and 211.6MB in the end (delta: -162.7MB). Peak memory consumption was 237.8MB. Max. memory is 16.1GB. * Witness Printer took 4.65ms. Allocated memory is still 545.3MB. Free memory was 211.6MB in the beginning and 211.4MB in the end (delta: 175.4kB). 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 someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L63] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] double_Array_0[0][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][0] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][0] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] double_Array_0[1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][0] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][0] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] double_Array_0[0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0][1] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L70] EXPR double_Array_0[0][1] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] double_Array_0[1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1][1] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L72] EXPR double_Array_0[1][1] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L83] EXPR 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_short_int_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] EXPR 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET updateVariables() [L99] CALL step() [L40] EXPR double_Array_0[0][0] [L40] EXPR double_Array_0[1][0] [L40] EXPR double_Array_0[0][1] [L40] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) [L40] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) [L43] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L46] EXPR unsigned_short_int_Array_0[2] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) [L46] EXPR unsigned_char_Array_0[0] [L46] EXPR unsigned_short_int_Array_0[1] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L46] COND FALSE !((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) [L49] signed_char_Array_0[1][1] = 5 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[0] [L51] unsigned char stepLocal_1 = unsigned_char_Array_0[0]; [L52] EXPR BOOL_unsigned_char_Array_0[0] [L52] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L53] stepLocal_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}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L53] EXPR unsigned_char_Array_0[0] [L53] EXPR unsigned_char_Array_0[0] [L53] stepLocal_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}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND TRUE stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L54] EXPR signed_char_Array_0[0][0] [L54] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L54] COND FALSE !(stepLocal_1 < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) [L99] RET step() [L100] CALL, EXPR property() [L90] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1 [L90] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) [L90] EXPR unsigned_short_int_Array_0[2] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR unsigned_short_int_Array_0[1] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)) [L90] EXPR signed_char_Array_0[1][1] [L90] EXPR ((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0])))))) [L90] EXPR BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR BOOL_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR signed_char_Array_0[0][0] [L90] EXPR signed_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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1 [L90] EXPR (unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L90] EXPR double_Array_0[0][0] [L90] EXPR double_Array_0[1][0] [L90] EXPR double_Array_0[0][1] [L90] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) [L90] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR (((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90-L91] return (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L100] RET, EXPR property() [L100] 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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8: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}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 179 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 27, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3906 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3888 mSDsluCounter, 21589 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16257 mSDsCounter, 378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3665 IncrementalHoareTripleChecker+Invalid, 4043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 378 mSolverCounterUnsat, 5332 mSDtfsCounter, 3665 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1070occurred in iteration=25, InterpolantAutomatonStates: 189, 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, 26 MinimizatonAttempts, 856 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 4355 NumberOfCodeBlocks, 4355 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3900 ConstructedInterpolants, 0 QuantifiedInterpolants, 10138 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1849 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 29 InterpolantComputations, 26 PerfectInterpolantSequences, 12068/12180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:13:52,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:13:54,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:13:54,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:13:54,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:13:54,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:13:54,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:13:54,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:13:54,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:13:54,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:13:54,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:13:54,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:13:54,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:13:54,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:13:54,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:13:54,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:13:54,882 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:13:54,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:13:54,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:54,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:13:54,884 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 [2025-03-08 16:13:55,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:13:55,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:13:55,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:13:55,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:13:55,206 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:13:55,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2025-03-08 16:13:56,388 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daea901df/0c3a9c4202ef4e2c9583b1a0f23be449/FLAG0bd04df59 [2025-03-08 16:13:56,561 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:13:56,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2025-03-08 16:13:56,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daea901df/0c3a9c4202ef4e2c9583b1a0f23be449/FLAG0bd04df59 [2025-03-08 16:13:56,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daea901df/0c3a9c4202ef4e2c9583b1a0f23be449 [2025-03-08 16:13:56,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:13:56,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:13:56,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:56,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:13:56,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:13:56,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cf14ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56, skipping insertion in model container [2025-03-08 16:13:56,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:13:56,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2025-03-08 16:13:56,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:56,801 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:13:56,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2025-03-08 16:13:56,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:56,879 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:13:56,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56 WrapperNode [2025-03-08 16:13:56,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:56,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:56,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:13:56,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:13:56,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,930 INFO L138 Inliner]: procedures = 33, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2025-03-08 16:13:56,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:56,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:13:56,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:13:56,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:13:56,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,979 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2025-03-08 16:13:56,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:56,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:57,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:57,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:57,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:57,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:57,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:13:57,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:13:57,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:13:57,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:13:57,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (1/1) ... [2025-03-08 16:13:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:57,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:57,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:13:57,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:13:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:13:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:13:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:13:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:13:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:13:57,193 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:13:57,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:14:09,673 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1; [2025-03-08 16:14:09,711 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-08 16:14:09,712 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:14:09,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:14:09,721 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:14:09,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:09 BoogieIcfgContainer [2025-03-08 16:14:09,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:14:09,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:14:09,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:14:09,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:14:09,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:13:56" (1/3) ... [2025-03-08 16:14:09,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f96a11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:09, skipping insertion in model container [2025-03-08 16:14:09,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:56" (2/3) ... [2025-03-08 16:14:09,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f96a11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:09, skipping insertion in model container [2025-03-08 16:14:09,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:09" (3/3) ... [2025-03-08 16:14:09,729 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-13.i [2025-03-08 16:14:09,738 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:14:09,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:14:09,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:14:09,782 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;@2bb0218f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:14:09,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:14:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:14:09,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:09,796 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:09,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 857864655, now seen corresponding path program 1 times [2025-03-08 16:14:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031662629] [2025-03-08 16:14:09,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:09,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:09,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:09,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:09,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:14:09,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:14:10,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:14:10,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:10,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:10,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:14:10,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 16:14:10,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:10,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031662629] [2025-03-08 16:14:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031662629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:14:10,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844922420] [2025-03-08 16:14:10,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:14:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:10,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:14:10,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:14:10,299 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:10,316 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-03-08 16:14:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:14:10,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-08 16:14:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:10,322 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:14:10,322 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:14:10,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:14:10,326 INFO L435 NwaCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:10,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:14:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:14:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-03-08 16:14:10,382 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-03-08 16:14:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:10,382 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-03-08 16:14:10,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-03-08 16:14:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:14:10,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:10,384 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:10,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:14:10,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:10,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:10,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:10,587 INFO L85 PathProgramCache]: Analyzing trace with hash 428592868, now seen corresponding path program 1 times [2025-03-08 16:14:10,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:10,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881388518] [2025-03-08 16:14:10,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:10,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:10,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:10,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:10,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:14:10,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:14:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:14:10,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:10,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:11,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:14:11,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:14:11,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:11,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881388518] [2025-03-08 16:14:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881388518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:14:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279177259] [2025-03-08 16:14:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:11,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:14:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:11,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:14:11,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:14:11,062 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:11,140 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2025-03-08 16:14:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:14:11,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-08 16:14:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:11,142 INFO L225 Difference]: With dead ends: 215 [2025-03-08 16:14:11,142 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 16:14:11,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:14:11,143 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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-03-08 16:14:11,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 16:14:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 16:14:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-03-08 16:14:11,152 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2025-03-08 16:14:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:11,153 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-03-08 16:14:11,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-03-08 16:14:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:14:11,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:11,155 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:11,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:14:11,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:11,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:11,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1425752669, now seen corresponding path program 1 times [2025-03-08 16:14:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:11,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401410296] [2025-03-08 16:14:11,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:11,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:11,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:11,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:11,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:14:11,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:14:11,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:14:11,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:11,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:14:11,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:14:11,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:11,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401410296] [2025-03-08 16:14:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401410296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:11,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:11,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:14:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599881801] [2025-03-08 16:14:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:11,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:14:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:11,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:14:11,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:14:11,801 INFO L87 Difference]: Start difference. First operand 110 states and 161 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:11,857 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2025-03-08 16:14:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:14:11,859 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:14:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:11,860 INFO L225 Difference]: With dead ends: 219 [2025-03-08 16:14:11,862 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:14:11,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:14:11,863 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:11,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:14:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 16:14:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2025-03-08 16:14:11,873 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 131 [2025-03-08 16:14:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:11,873 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2025-03-08 16:14:11,874 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2025-03-08 16:14:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:14:11,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:11,875 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:11,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:14:12,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:12,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:12,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash 56129601, now seen corresponding path program 1 times [2025-03-08 16:14:12,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:12,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406387930] [2025-03-08 16:14:12,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:12,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:12,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:14:12,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:14:12,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:14:12,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:12,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:12,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:14:12,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 68 proven. 39 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-08 16:14:13,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:14:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:14:13,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406387930] [2025-03-08 16:14:13,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406387930] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:14:13,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:14:13,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-08 16:14:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031366792] [2025-03-08 16:14:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:13,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:14:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:13,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:14:13,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:14:13,249 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:13,335 INFO L93 Difference]: Finished difference Result 263 states and 384 transitions. [2025-03-08 16:14:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:14:13,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-03-08 16:14:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:13,337 INFO L225 Difference]: With dead ends: 263 [2025-03-08 16:14:13,337 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 16:14:13,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:14:13,339 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 104 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:13,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 454 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 16:14:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2025-03-08 16:14:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2025-03-08 16:14:13,353 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 133 [2025-03-08 16:14:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:13,354 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2025-03-08 16:14:13,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2025-03-08 16:14:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:14:13,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:13,356 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:13,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:14:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:13,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1994814050, now seen corresponding path program 1 times [2025-03-08 16:14:13,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:13,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666449276] [2025-03-08 16:14:13,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:13,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:13,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:13,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:13,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:14:13,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:14:13,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:14:13,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:13,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:13,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:14:13,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:14,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:14,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-08 16:14:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-08 16:14:14,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:14,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:14,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666449276] [2025-03-08 16:14:14,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666449276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:14,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:14,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684621834] [2025-03-08 16:14:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:14,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:14,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:14,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:14,230 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:16,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:19,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:21,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:23,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:23,581 INFO L93 Difference]: Finished difference Result 248 states and 364 transitions. [2025-03-08 16:14:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:14:23,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-08 16:14:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:23,603 INFO L225 Difference]: With dead ends: 248 [2025-03-08 16:14:23,603 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 16:14:23,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:23,604 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 144 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:23,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 489 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2025-03-08 16:14:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 16:14:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-03-08 16:14:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2025-03-08 16:14:23,616 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 134 [2025-03-08 16:14:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:23,616 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2025-03-08 16:14:23,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2025-03-08 16:14:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:14:23,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:23,617 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:23,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 16:14:23,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:23,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash -5306660, now seen corresponding path program 1 times [2025-03-08 16:14:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744305825] [2025-03-08 16:14:23,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:23,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:23,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:23,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:23,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:14:23,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:24,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:24,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:14:24,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:24,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:24,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-08 16:14:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 16:14:24,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:24,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744305825] [2025-03-08 16:14:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744305825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:24,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:24,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557401270] [2025-03-08 16:14:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:24,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:24,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:24,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:24,378 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:26,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:28,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:31,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:33,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:33,117 INFO L93 Difference]: Finished difference Result 248 states and 362 transitions. [2025-03-08 16:14:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:14:33,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-08 16:14:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:33,136 INFO L225 Difference]: With dead ends: 248 [2025-03-08 16:14:33,136 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 16:14:33,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:33,137 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 136 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:33,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 485 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-08 16:14:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 16:14:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-03-08 16:14:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 108 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2025-03-08 16:14:33,149 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 136 [2025-03-08 16:14:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:33,149 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2025-03-08 16:14:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2025-03-08 16:14:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:33,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:33,151 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:33,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 16:14:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:33,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:33,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -154556514, now seen corresponding path program 1 times [2025-03-08 16:14:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:33,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570406684] [2025-03-08 16:14:33,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:33,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:33,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:33,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:33,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 16:14:33,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:33,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:33,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:33,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:33,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:14:33,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:33,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 16:14:33,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2025-03-08 16:14:33,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2025-03-08 16:14:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:14:34,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:34,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570406684] [2025-03-08 16:14:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570406684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:34,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:34,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:14:34,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289904] [2025-03-08 16:14:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:34,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:14:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:34,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:14:34,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:14:34,029 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:37,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:38,060 INFO L93 Difference]: Finished difference Result 372 states and 536 transitions. [2025-03-08 16:14:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:14:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-08 16:14:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:38,063 INFO L225 Difference]: With dead ends: 372 [2025-03-08 16:14:38,064 INFO L226 Difference]: Without dead ends: 250 [2025-03-08 16:14:38,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:14:38,064 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 256 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:38,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 865 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 16:14:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-08 16:14:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 139. [2025-03-08 16:14:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2025-03-08 16:14:38,078 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 138 [2025-03-08 16:14:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:38,079 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2025-03-08 16:14:38,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2025-03-08 16:14:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:38,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:38,080 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:38,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-08 16:14:38,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:38,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:38,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:38,281 INFO L85 PathProgramCache]: Analyzing trace with hash -563380739, now seen corresponding path program 1 times [2025-03-08 16:14:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:38,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503247649] [2025-03-08 16:14:38,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:38,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:38,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:38,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:38,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-08 16:14:38,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:38,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:38,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:38,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:38,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 16:14:38,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:38,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 16:14:39,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2025-03-08 16:14:39,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2025-03-08 16:14:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:14:39,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:39,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503247649] [2025-03-08 16:14:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503247649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:14:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479717347] [2025-03-08 16:14:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:39,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:14:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:39,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:14:39,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:39,260 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:41,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:43,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:46,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:46,831 INFO L93 Difference]: Finished difference Result 387 states and 553 transitions. [2025-03-08 16:14:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:14:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-08 16:14:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:46,833 INFO L225 Difference]: With dead ends: 387 [2025-03-08 16:14:46,833 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 16:14:46,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:14:46,833 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 302 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:46,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 942 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-03-08 16:14:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 16:14:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2025-03-08 16:14:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 151 states have (on average 1.4172185430463575) internal successors, (214), 151 states have internal predecessors, (214), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2025-03-08 16:14:46,845 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 138 [2025-03-08 16:14:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:46,845 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2025-03-08 16:14:46,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2025-03-08 16:14:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:46,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:46,846 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:46,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-08 16:14:47,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:47,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:47,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash -759894244, now seen corresponding path program 1 times [2025-03-08 16:14:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:47,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258029684] [2025-03-08 16:14:47,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:47,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:47,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:47,050 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:47,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 16:14:47,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:47,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:47,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:47,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:47,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:14:47,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:47,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-08 16:14:47,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2025-03-08 16:14:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:14:47,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:47,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258029684] [2025-03-08 16:14:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258029684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872959652] [2025-03-08 16:14:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:47,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:47,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:47,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:47,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:47,607 INFO L87 Difference]: Start difference. First operand 169 states and 244 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:47,988 INFO L93 Difference]: Finished difference Result 504 states and 730 transitions. [2025-03-08 16:14:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:47,989 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-03-08 16:14:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:47,991 INFO L225 Difference]: With dead ends: 504 [2025-03-08 16:14:47,991 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 16:14:47,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:47,992 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 143 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:47,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1041 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:14:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 16:14:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 228. [2025-03-08 16:14:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 210 states have (on average 1.438095238095238) internal successors, (302), 210 states have internal predecessors, (302), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:14:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 332 transitions. [2025-03-08 16:14:48,002 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 332 transitions. Word has length 138 [2025-03-08 16:14:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:48,002 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 332 transitions. [2025-03-08 16:14:48,002 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 332 transitions. [2025-03-08 16:14:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:48,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:48,003 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:48,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-08 16:14:48,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:48,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:48,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1934635198, now seen corresponding path program 1 times [2025-03-08 16:14:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592251650] [2025-03-08 16:14:48,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:48,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:48,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:48,208 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:48,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-08 16:14:48,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:48,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:48,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:14:48,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:14:48,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:48,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:48,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592251650] [2025-03-08 16:14:48,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592251650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:48,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587290108] [2025-03-08 16:14:48,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:48,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:14:48,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:48,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:14:48,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:14:48,722 INFO L87 Difference]: Start difference. First operand 228 states and 332 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:49,028 INFO L93 Difference]: Finished difference Result 583 states and 848 transitions. [2025-03-08 16:14:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-03-08 16:14:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:49,030 INFO L225 Difference]: With dead ends: 583 [2025-03-08 16:14:49,030 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 16:14:49,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:49,031 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 142 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:49,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 526 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:14:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 16:14:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 352. [2025-03-08 16:14:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 317 states have (on average 1.4100946372239747) internal successors, (447), 317 states have internal predecessors, (447), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:14:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 507 transitions. [2025-03-08 16:14:49,047 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 507 transitions. Word has length 138 [2025-03-08 16:14:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:49,048 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 507 transitions. [2025-03-08 16:14:49,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:14:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 507 transitions. [2025-03-08 16:14:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:49,049 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:49,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-08 16:14:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:49,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:49,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2063201439, now seen corresponding path program 1 times [2025-03-08 16:14:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741235964] [2025-03-08 16:14:49,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:49,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:49,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:49,252 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:49,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-08 16:14:49,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:49,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:49,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:49,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:49,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 16:14:49,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:50,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2025-03-08 16:14:50,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2025-03-08 16:14:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:14:50,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:50,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:50,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741235964] [2025-03-08 16:14:50,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741235964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:50,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:50,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:14:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938302340] [2025-03-08 16:14:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:50,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:14:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:50,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:14:50,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:14:50,206 INFO L87 Difference]: Start difference. First operand 352 states and 507 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:52,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:54,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:54,346 INFO L93 Difference]: Finished difference Result 958 states and 1375 transitions. [2025-03-08 16:14:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:14:54,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-08 16:14:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:54,368 INFO L225 Difference]: With dead ends: 958 [2025-03-08 16:14:54,368 INFO L226 Difference]: Without dead ends: 609 [2025-03-08 16:14:54,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:14:54,370 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 211 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:54,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 749 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 16:14:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-08 16:14:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 599. [2025-03-08 16:14:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 530 states have (on average 1.3962264150943395) internal successors, (740), 530 states have internal predecessors, (740), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:14:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 860 transitions. [2025-03-08 16:14:54,403 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 860 transitions. Word has length 138 [2025-03-08 16:14:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:54,403 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 860 transitions. [2025-03-08 16:14:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 860 transitions. [2025-03-08 16:14:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:54,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:54,404 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:54,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-08 16:14:54,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:54,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:54,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1654377214, now seen corresponding path program 1 times [2025-03-08 16:14:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:54,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821531727] [2025-03-08 16:14:54,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:14:54,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:54,607 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:14:54,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-08 16:14:54,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:55,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:55,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:55,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 16:14:55,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:56,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2025-03-08 16:14:56,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2025-03-08 16:14:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:14:56,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:56,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821531727] [2025-03-08 16:14:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821531727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:56,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:56,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:14:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116867890] [2025-03-08 16:14:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:56,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:14:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:56,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:14:56,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:56,082 INFO L87 Difference]: Start difference. First operand 599 states and 860 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:14:58,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:15:02,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]