./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.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 c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:15:52,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:15:52,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:15:52,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:15:52,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:15:52,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:15:52,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:15:52,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:15:52,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:15:52,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:15:52,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:15:52,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:15:52,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:15:52,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:15:52,664 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:15:52,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:15:52,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:15:52,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:15:52,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:15:52,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:15:52,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:15:52,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:15:52,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:15:52,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:15:52,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:15:52,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:15:52,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:15:52,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:15:52,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:15:52,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:15:52,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:15:52,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:15:52,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:15:52,667 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 -> c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d [2025-03-04 01:15:52,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:15:52,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:15:52,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:15:52,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:15:52,908 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:15:52,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2025-03-04 01:15:54,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f232c13bc/f88a6510cae54298b6babd3cfa91035a/FLAGf9918d3e4 [2025-03-04 01:15:54,300 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:15:54,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2025-03-04 01:15:54,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f232c13bc/f88a6510cae54298b6babd3cfa91035a/FLAGf9918d3e4 [2025-03-04 01:15:54,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f232c13bc/f88a6510cae54298b6babd3cfa91035a [2025-03-04 01:15:54,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:15:54,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:15:54,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:15:54,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:15:54,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:15:54,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b5a6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54, skipping insertion in model container [2025-03-04 01:15:54,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:15:54,478 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-ap_file-33.i[917,930] [2025-03-04 01:15:54,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:15:54,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:15:54,550 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-ap_file-33.i[917,930] [2025-03-04 01:15:54,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:15:54,586 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:15:54,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54 WrapperNode [2025-03-04 01:15:54,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:15:54,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:15:54,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:15:54,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:15:54,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,629 INFO L138 Inliner]: procedures = 29, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-03-04 01:15:54,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:15:54,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:15:54,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:15:54,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:15:54,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,668 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 44, 21, 11, 31]. 38 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 2, 2]. The 15 writes are split as follows [0, 1, 5, 4, 3, 2]. [2025-03-04 01:15:54,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,682 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:15:54,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:15:54,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:15:54,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:15:54,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (1/1) ... [2025-03-04 01:15:54,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:15:54,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:15:54,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:15:54,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:15:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:15:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:15:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:15:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:15:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:15:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:15:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:15:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:15:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:15:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:15:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:15:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:15:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:15:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:15:54,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:15:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:15:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:15:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:15:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:15:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:15:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:15:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:15:54,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:15:54,863 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:15:54,864 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:15:55,263 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~bitwise73#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~bitwise89#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite100#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1; [2025-03-04 01:15:55,303 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2025-03-04 01:15:55,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:15:55,325 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:15:55,327 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:15:55,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:15:55 BoogieIcfgContainer [2025-03-04 01:15:55,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:15:55,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:15:55,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:15:55,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:15:55,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:15:54" (1/3) ... [2025-03-04 01:15:55,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7608fa7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:15:55, skipping insertion in model container [2025-03-04 01:15:55,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:15:54" (2/3) ... [2025-03-04 01:15:55,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7608fa7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:15:55, skipping insertion in model container [2025-03-04 01:15:55,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:15:55" (3/3) ... [2025-03-04 01:15:55,336 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-33.i [2025-03-04 01:15:55,346 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:15:55,347 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-33.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:15:55,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:15:55,401 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;@5c1a0a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:15:55,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:15:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:15:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:15:55,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:55,414 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:55,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:55,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1053227623, now seen corresponding path program 1 times [2025-03-04 01:15:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:15:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080620818] [2025-03-04 01:15:55,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:15:55,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:55,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:55,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:55,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:15:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:15:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080620818] [2025-03-04 01:15:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080620818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:15:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468731669] [2025-03-04 01:15:55,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:55,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:15:55,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:15:55,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:15:55,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:15:55,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:55,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:55,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:55,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:15:55,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:15:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:15:55,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:15:55,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468731669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:15:55,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:15:55,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:15:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510205571] [2025-03-04 01:15:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:55,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:15:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:15:55,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:15:55,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:15:55,927 INFO L87 Difference]: Start difference. First operand has 106 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:15:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:55,960 INFO L93 Difference]: Finished difference Result 206 states and 316 transitions. [2025-03-04 01:15:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:15:55,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-04 01:15:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:55,968 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:15:55,969 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:15:55,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:15:55,975 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:55,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:15:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:15:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 01:15:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:15:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-04 01:15:56,000 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 98 [2025-03-04 01:15:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:56,000 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-04 01:15:56,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:15:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-04 01:15:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:15:56,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:56,003 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:56,010 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-04 01:15:56,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:15:56,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:56,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -483291676, now seen corresponding path program 1 times [2025-03-04 01:15:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:15:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492630480] [2025-03-04 01:15:56,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:15:56,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:56,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:56,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:56,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:15:56,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:15:56,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492630480] [2025-03-04 01:15:56,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492630480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:15:56,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:15:56,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:15:56,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479986864] [2025-03-04 01:15:56,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:56,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:15:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:15:56,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:15:56,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:15:56,443 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:56,508 INFO L93 Difference]: Finished difference Result 206 states and 303 transitions. [2025-03-04 01:15:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:15:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-04 01:15:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:56,511 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:15:56,511 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:15:56,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:15:56,512 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:56,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:15:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:15:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-04 01:15:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:15:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-04 01:15:56,524 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 98 [2025-03-04 01:15:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:56,525 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-04 01:15:56,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-04 01:15:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:15:56,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:56,528 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:56,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:15:56,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:56,530 INFO L85 PathProgramCache]: Analyzing trace with hash 404212005, now seen corresponding path program 1 times [2025-03-04 01:15:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:15:56,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999443156] [2025-03-04 01:15:56,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:15:56,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:56,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:56,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:56,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:15:56,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:15:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999443156] [2025-03-04 01:15:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999443156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:15:56,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:15:56,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:15:56,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800134290] [2025-03-04 01:15:56,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:56,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:15:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:15:56,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:15:56,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:15:56,704 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:56,750 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2025-03-04 01:15:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:15:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-04 01:15:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:56,752 INFO L225 Difference]: With dead ends: 210 [2025-03-04 01:15:56,754 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:15:56,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:15:56,755 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:56,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:15:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:15:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-04 01:15:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:15:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-04 01:15:56,764 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 98 [2025-03-04 01:15:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-04 01:15:56,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-04 01:15:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:15:56,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:56,768 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:15:56,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 405135526, now seen corresponding path program 1 times [2025-03-04 01:15:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:15:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245015278] [2025-03-04 01:15:56,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:15:56,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:56,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:56,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:56,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:15:57,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:15:57,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245015278] [2025-03-04 01:15:57,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245015278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:15:57,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:15:57,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:15:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940505023] [2025-03-04 01:15:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:57,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:15:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:15:57,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:15:57,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:15:57,062 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:57,134 INFO L93 Difference]: Finished difference Result 297 states and 431 transitions. [2025-03-04 01:15:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:15:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-04 01:15:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:57,137 INFO L225 Difference]: With dead ends: 297 [2025-03-04 01:15:57,138 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 01:15:57,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:15:57,139 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 111 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:57,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 679 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:15:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 01:15:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2025-03-04 01:15:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 173 states have (on average 1.4335260115606936) internal successors, (248), 174 states have internal predecessors, (248), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:15:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions. [2025-03-04 01:15:57,157 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 98 [2025-03-04 01:15:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:57,158 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 276 transitions. [2025-03-04 01:15:57,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 276 transitions. [2025-03-04 01:15:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:15:57,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:57,160 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:57,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:15:57,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:57,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1912687335, now seen corresponding path program 1 times [2025-03-04 01:15:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:15:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545111757] [2025-03-04 01:15:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:15:57,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:57,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:57,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:57,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:15:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:15:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545111757] [2025-03-04 01:15:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545111757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:15:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:15:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:15:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293811068] [2025-03-04 01:15:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:57,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:15:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:15:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:15:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:15:57,643 INFO L87 Difference]: Start difference. First operand 190 states and 276 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:57,976 INFO L93 Difference]: Finished difference Result 414 states and 602 transitions. [2025-03-04 01:15:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:15:57,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-04 01:15:57,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:57,979 INFO L225 Difference]: With dead ends: 414 [2025-03-04 01:15:57,979 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 01:15:57,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:15:57,980 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 254 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:57,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 520 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:15:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 01:15:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2025-03-04 01:15:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.4179104477611941) internal successors, (285), 203 states have internal predecessors, (285), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:15:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2025-03-04 01:15:57,999 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 98 [2025-03-04 01:15:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:57,999 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2025-03-04 01:15:57,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2025-03-04 01:15:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:15:58,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:58,000 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:58,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:15:58,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:58,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1649900007, now seen corresponding path program 1 times [2025-03-04 01:15:58,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:15:58,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972343791] [2025-03-04 01:15:58,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:58,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:15:58,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:58,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:58,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:58,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:15:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:15:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972343791] [2025-03-04 01:15:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972343791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:15:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:15:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:15:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962754108] [2025-03-04 01:15:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:15:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:15:58,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:15:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:15:58,399 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:58,621 INFO L93 Difference]: Finished difference Result 435 states and 625 transitions. [2025-03-04 01:15:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:15:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-04 01:15:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:58,622 INFO L225 Difference]: With dead ends: 435 [2025-03-04 01:15:58,623 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 01:15:58,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:15:58,624 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 491 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:58,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 547 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:15:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 01:15:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2025-03-04 01:15:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 210 states have (on average 1.4) internal successors, (294), 212 states have internal predecessors, (294), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:15:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 340 transitions. [2025-03-04 01:15:58,644 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 340 transitions. Word has length 98 [2025-03-04 01:15:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:58,645 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 340 transitions. [2025-03-04 01:15:58,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:15:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 340 transitions. [2025-03-04 01:15:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:15:58,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:58,646 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:58,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:15:58,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:58,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1137515480, now seen corresponding path program 1 times [2025-03-04 01:15:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:15:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355020390] [2025-03-04 01:15:58,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:15:58,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:15:58,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:15:58,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:58,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:15:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:15:59,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355020390] [2025-03-04 01:15:59,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355020390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:15:59,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:15:59,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:15:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732399134] [2025-03-04 01:15:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:59,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:15:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:15:59,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:15:59,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:15:59,822 INFO L87 Difference]: Start difference. First operand 238 states and 340 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:00,868 INFO L93 Difference]: Finished difference Result 1023 states and 1460 transitions. [2025-03-04 01:16:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:16:00,869 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 98 [2025-03-04 01:16:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:00,872 INFO L225 Difference]: With dead ends: 1023 [2025-03-04 01:16:00,872 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 01:16:00,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:16:00,874 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 1077 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:00,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1870 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:16:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 01:16:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 377. [2025-03-04 01:16:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.4065281899109792) internal successors, (474), 339 states have internal predecessors, (474), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:16:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2025-03-04 01:16:00,902 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 98 [2025-03-04 01:16:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:00,902 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2025-03-04 01:16:00,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2025-03-04 01:16:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:16:00,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:00,903 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:00,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:16:00,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash -444413783, now seen corresponding path program 1 times [2025-03-04 01:16:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852433043] [2025-03-04 01:16:00,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:00,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:16:00,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:16:00,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:00,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852433043] [2025-03-04 01:16:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852433043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:01,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:01,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:16:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364759733] [2025-03-04 01:16:01,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:01,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:16:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:01,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:16:01,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:16:01,788 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:02,403 INFO L93 Difference]: Finished difference Result 923 states and 1313 transitions. [2025-03-04 01:16:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:16:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-04 01:16:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:02,407 INFO L225 Difference]: With dead ends: 923 [2025-03-04 01:16:02,407 INFO L226 Difference]: Without dead ends: 587 [2025-03-04 01:16:02,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:16:02,408 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 412 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:02,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1855 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-04 01:16:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 377. [2025-03-04 01:16:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.4065281899109792) internal successors, (474), 339 states have internal predecessors, (474), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:16:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2025-03-04 01:16:02,445 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 98 [2025-03-04 01:16:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:02,445 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2025-03-04 01:16:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2025-03-04 01:16:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:16:02,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:02,447 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:16:02,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:02,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 751282585, now seen corresponding path program 1 times [2025-03-04 01:16:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332251502] [2025-03-04 01:16:02,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:02,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:16:02,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:16:02,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:02,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332251502] [2025-03-04 01:16:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332251502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:02,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:02,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:16:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122236521] [2025-03-04 01:16:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:02,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:16:02,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:02,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:16:02,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:16:02,522 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:02,683 INFO L93 Difference]: Finished difference Result 924 states and 1311 transitions. [2025-03-04 01:16:02,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:16:02,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-04 01:16:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:02,686 INFO L225 Difference]: With dead ends: 924 [2025-03-04 01:16:02,686 INFO L226 Difference]: Without dead ends: 588 [2025-03-04 01:16:02,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:16:02,687 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 139 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:02,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 647 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-04 01:16:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 405. [2025-03-04 01:16:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 365 states have (on average 1.4027397260273973) internal successors, (512), 367 states have internal predecessors, (512), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:16:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 576 transitions. [2025-03-04 01:16:02,718 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 576 transitions. Word has length 99 [2025-03-04 01:16:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:02,719 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 576 transitions. [2025-03-04 01:16:02,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 576 transitions. [2025-03-04 01:16:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:16:02,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:02,720 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:02,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:16:02,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1529785509, now seen corresponding path program 1 times [2025-03-04 01:16:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846763966] [2025-03-04 01:16:02,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:02,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:02,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:16:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:16:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:02,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846763966] [2025-03-04 01:16:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846763966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:02,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:16:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80839142] [2025-03-04 01:16:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:16:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:02,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:16:02,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:16:02,784 INFO L87 Difference]: Start difference. First operand 405 states and 576 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:02,937 INFO L93 Difference]: Finished difference Result 940 states and 1326 transitions. [2025-03-04 01:16:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:16:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-04 01:16:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:02,940 INFO L225 Difference]: With dead ends: 940 [2025-03-04 01:16:02,940 INFO L226 Difference]: Without dead ends: 576 [2025-03-04 01:16:02,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:02,941 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 124 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:02,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 653 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-04 01:16:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 405. [2025-03-04 01:16:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 365 states have (on average 1.3972602739726028) internal successors, (510), 367 states have internal predecessors, (510), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:16:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 574 transitions. [2025-03-04 01:16:02,971 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 574 transitions. Word has length 99 [2025-03-04 01:16:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:02,971 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 574 transitions. [2025-03-04 01:16:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 574 transitions. [2025-03-04 01:16:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:16:02,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:02,972 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:16:02,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:02,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash 968327319, now seen corresponding path program 1 times [2025-03-04 01:16:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073853961] [2025-03-04 01:16:02,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:02,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:16:02,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:16:02,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:02,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:03,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:03,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073853961] [2025-03-04 01:16:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073853961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:03,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:03,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:16:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296591358] [2025-03-04 01:16:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:03,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:03,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:03,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:03,170 INFO L87 Difference]: Start difference. First operand 405 states and 574 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:03,281 INFO L93 Difference]: Finished difference Result 857 states and 1222 transitions. [2025-03-04 01:16:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-04 01:16:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:03,284 INFO L225 Difference]: With dead ends: 857 [2025-03-04 01:16:03,284 INFO L226 Difference]: Without dead ends: 493 [2025-03-04 01:16:03,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:03,285 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 28 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:03,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 624 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-04 01:16:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 405. [2025-03-04 01:16:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 365 states have (on average 1.3917808219178083) internal successors, (508), 367 states have internal predecessors, (508), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:16:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 572 transitions. [2025-03-04 01:16:03,320 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 572 transitions. Word has length 99 [2025-03-04 01:16:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:03,320 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 572 transitions. [2025-03-04 01:16:03,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 572 transitions. [2025-03-04 01:16:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:16:03,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:03,321 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:03,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:16:03,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:03,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1929941336, now seen corresponding path program 1 times [2025-03-04 01:16:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:03,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465842270] [2025-03-04 01:16:03,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:03,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:16:03,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:16:03,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:03,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:16:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465842270] [2025-03-04 01:16:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465842270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:16:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756856835] [2025-03-04 01:16:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:16:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:03,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:16:03,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:03,735 INFO L87 Difference]: Start difference. First operand 405 states and 572 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:04,567 INFO L93 Difference]: Finished difference Result 1253 states and 1760 transitions. [2025-03-04 01:16:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 01:16:04,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2025-03-04 01:16:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:04,571 INFO L225 Difference]: With dead ends: 1253 [2025-03-04 01:16:04,571 INFO L226 Difference]: Without dead ends: 889 [2025-03-04 01:16:04,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:16:04,573 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 690 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:04,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1833 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:16:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-04 01:16:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 404. [2025-03-04 01:16:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 366 states have (on average 1.3907103825136613) internal successors, (509), 368 states have internal predecessors, (509), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:16:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 569 transitions. [2025-03-04 01:16:04,606 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 569 transitions. Word has length 99 [2025-03-04 01:16:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:04,607 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 569 transitions. [2025-03-04 01:16:04,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 569 transitions. [2025-03-04 01:16:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:16:04,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:04,609 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:04,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:16:04,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:04,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1599035829, now seen corresponding path program 1 times [2025-03-04 01:16:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:04,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480340199] [2025-03-04 01:16:04,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:04,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:16:04,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:16:04,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:04,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480340199] [2025-03-04 01:16:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480340199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:04,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:16:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297309471] [2025-03-04 01:16:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:16:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:04,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:16:04,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:16:04,848 INFO L87 Difference]: Start difference. First operand 404 states and 569 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:05,528 INFO L93 Difference]: Finished difference Result 1211 states and 1693 transitions. [2025-03-04 01:16:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:16:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-04 01:16:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:05,531 INFO L225 Difference]: With dead ends: 1211 [2025-03-04 01:16:05,531 INFO L226 Difference]: Without dead ends: 844 [2025-03-04 01:16:05,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:16:05,533 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 392 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:05,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 2354 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:16:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-04 01:16:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 530. [2025-03-04 01:16:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 483 states have (on average 1.3975155279503106) internal successors, (675), 486 states have internal predecessors, (675), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 749 transitions. [2025-03-04 01:16:05,567 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 749 transitions. Word has length 100 [2025-03-04 01:16:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:05,567 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 749 transitions. [2025-03-04 01:16:05,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 749 transitions. [2025-03-04 01:16:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:16:05,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:05,569 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:05,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:16:05,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:05,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1121372905, now seen corresponding path program 1 times [2025-03-04 01:16:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:05,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548303279] [2025-03-04 01:16:05,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:05,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:16:05,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:16:05,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:05,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:05,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:05,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548303279] [2025-03-04 01:16:05,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548303279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:05,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:05,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:16:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377156205] [2025-03-04 01:16:05,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:05,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:16:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:05,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:16:05,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:16:05,849 INFO L87 Difference]: Start difference. First operand 530 states and 749 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:06,600 INFO L93 Difference]: Finished difference Result 1451 states and 2041 transitions. [2025-03-04 01:16:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:16:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-04 01:16:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:06,605 INFO L225 Difference]: With dead ends: 1451 [2025-03-04 01:16:06,605 INFO L226 Difference]: Without dead ends: 958 [2025-03-04 01:16:06,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:16:06,606 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 558 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:06,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1874 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:16:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-03-04 01:16:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 556. [2025-03-04 01:16:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 509 states have (on average 1.4086444007858545) internal successors, (717), 512 states have internal predecessors, (717), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 791 transitions. [2025-03-04 01:16:06,645 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 791 transitions. Word has length 100 [2025-03-04 01:16:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:06,645 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 791 transitions. [2025-03-04 01:16:06,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 791 transitions. [2025-03-04 01:16:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:16:06,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:06,647 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:06,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:16:06,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:06,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1666042582, now seen corresponding path program 1 times [2025-03-04 01:16:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:06,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124945591] [2025-03-04 01:16:06,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:06,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:16:06,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:16:06,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:06,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:16:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124945591] [2025-03-04 01:16:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124945591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:16:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130218204] [2025-03-04 01:16:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:16:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:07,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:16:07,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:16:07,241 INFO L87 Difference]: Start difference. First operand 556 states and 791 transitions. Second operand has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:08,956 INFO L93 Difference]: Finished difference Result 1261 states and 1772 transitions. [2025-03-04 01:16:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 01:16:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 100 [2025-03-04 01:16:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:08,959 INFO L225 Difference]: With dead ends: 1261 [2025-03-04 01:16:08,959 INFO L226 Difference]: Without dead ends: 742 [2025-03-04 01:16:08,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 01:16:08,961 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 813 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:08,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1536 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:16:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-04 01:16:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 505. [2025-03-04 01:16:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 458 states have (on average 1.3755458515283843) internal successors, (630), 461 states have internal predecessors, (630), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 704 transitions. [2025-03-04 01:16:08,995 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 704 transitions. Word has length 100 [2025-03-04 01:16:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 704 transitions. [2025-03-04 01:16:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 704 transitions. [2025-03-04 01:16:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:16:08,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:08,996 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:08,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:16:08,997 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1124095526, now seen corresponding path program 1 times [2025-03-04 01:16:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567874011] [2025-03-04 01:16:08,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:09,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:16:09,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:16:09,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:09,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567874011] [2025-03-04 01:16:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567874011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:16:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612718651] [2025-03-04 01:16:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:09,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:16:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:09,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:16:09,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:16:09,931 INFO L87 Difference]: Start difference. First operand 505 states and 704 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:11,295 INFO L93 Difference]: Finished difference Result 1658 states and 2312 transitions. [2025-03-04 01:16:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:16:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 100 [2025-03-04 01:16:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:11,300 INFO L225 Difference]: With dead ends: 1658 [2025-03-04 01:16:11,300 INFO L226 Difference]: Without dead ends: 1190 [2025-03-04 01:16:11,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:16:11,301 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 687 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:11,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1733 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:16:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2025-03-04 01:16:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 536. [2025-03-04 01:16:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 489 states have (on average 1.3660531697341514) internal successors, (668), 492 states have internal predecessors, (668), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 742 transitions. [2025-03-04 01:16:11,348 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 742 transitions. Word has length 100 [2025-03-04 01:16:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:11,349 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 742 transitions. [2025-03-04 01:16:11,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 742 transitions. [2025-03-04 01:16:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:16:11,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:11,350 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:11,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:16:11,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1474895463, now seen corresponding path program 1 times [2025-03-04 01:16:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664191682] [2025-03-04 01:16:11,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:11,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:16:11,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:16:11,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:11,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664191682] [2025-03-04 01:16:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664191682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:11,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:11,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:16:11,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62844910] [2025-03-04 01:16:11,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:11,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:16:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:11,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:16:11,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:11,629 INFO L87 Difference]: Start difference. First operand 536 states and 742 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:11,788 INFO L93 Difference]: Finished difference Result 1255 states and 1736 transitions. [2025-03-04 01:16:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:16:11,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-04 01:16:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:11,792 INFO L225 Difference]: With dead ends: 1255 [2025-03-04 01:16:11,792 INFO L226 Difference]: Without dead ends: 756 [2025-03-04 01:16:11,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:11,793 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 273 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:11,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 820 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-04 01:16:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 620. [2025-03-04 01:16:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 573 states have (on average 1.3647469458987784) internal successors, (782), 576 states have internal predecessors, (782), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 856 transitions. [2025-03-04 01:16:11,839 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 856 transitions. Word has length 100 [2025-03-04 01:16:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:11,841 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 856 transitions. [2025-03-04 01:16:11,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 856 transitions. [2025-03-04 01:16:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:16:11,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:11,842 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:16:11,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -218661005, now seen corresponding path program 1 times [2025-03-04 01:16:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216457268] [2025-03-04 01:16:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:11,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:16:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:16:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216457268] [2025-03-04 01:16:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216457268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:16:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803434179] [2025-03-04 01:16:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:16:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:12,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:16:12,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:12,046 INFO L87 Difference]: Start difference. First operand 620 states and 856 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:12,546 INFO L93 Difference]: Finished difference Result 1564 states and 2145 transitions. [2025-03-04 01:16:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:16:12,548 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-03-04 01:16:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:12,550 INFO L225 Difference]: With dead ends: 1564 [2025-03-04 01:16:12,550 INFO L226 Difference]: Without dead ends: 975 [2025-03-04 01:16:12,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:16:12,553 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 405 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:12,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1904 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-04 01:16:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 655. [2025-03-04 01:16:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 608 states have (on average 1.3667763157894737) internal successors, (831), 611 states have internal predecessors, (831), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 905 transitions. [2025-03-04 01:16:12,619 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 905 transitions. Word has length 101 [2025-03-04 01:16:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:12,619 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 905 transitions. [2025-03-04 01:16:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 905 transitions. [2025-03-04 01:16:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:16:12,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:12,622 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:12,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:16:12,622 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:12,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash 491545139, now seen corresponding path program 1 times [2025-03-04 01:16:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891583090] [2025-03-04 01:16:12,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:12,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:16:12,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:16:12,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:12,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891583090] [2025-03-04 01:16:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891583090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:16:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698989701] [2025-03-04 01:16:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:12,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:16:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:12,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:16:12,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:12,854 INFO L87 Difference]: Start difference. First operand 655 states and 905 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:13,561 INFO L93 Difference]: Finished difference Result 2296 states and 3171 transitions. [2025-03-04 01:16:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:16:13,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-03-04 01:16:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:13,566 INFO L225 Difference]: With dead ends: 2296 [2025-03-04 01:16:13,566 INFO L226 Difference]: Without dead ends: 1672 [2025-03-04 01:16:13,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:16:13,568 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 365 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:13,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1636 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:16:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-03-04 01:16:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 766. [2025-03-04 01:16:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 719 states have (on average 1.3852573018080667) internal successors, (996), 722 states have internal predecessors, (996), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1070 transitions. [2025-03-04 01:16:13,622 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1070 transitions. Word has length 101 [2025-03-04 01:16:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:13,622 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1070 transitions. [2025-03-04 01:16:13,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1070 transitions. [2025-03-04 01:16:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:16:13,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:13,623 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:13,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:16:13,624 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:13,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1999096948, now seen corresponding path program 1 times [2025-03-04 01:16:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:13,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969593652] [2025-03-04 01:16:13,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:13,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:16:13,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:16:13,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:13,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969593652] [2025-03-04 01:16:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969593652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:14,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:16:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243780266] [2025-03-04 01:16:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:16:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:14,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:16:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:16:14,144 INFO L87 Difference]: Start difference. First operand 766 states and 1070 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:15,139 INFO L93 Difference]: Finished difference Result 2075 states and 2888 transitions. [2025-03-04 01:16:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:16:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2025-03-04 01:16:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:15,143 INFO L225 Difference]: With dead ends: 2075 [2025-03-04 01:16:15,144 INFO L226 Difference]: Without dead ends: 1346 [2025-03-04 01:16:15,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:16:15,145 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 935 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:15,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1309 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:16:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-04 01:16:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 762. [2025-03-04 01:16:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 715 states have (on average 1.3804195804195805) internal successors, (987), 718 states have internal predecessors, (987), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1061 transitions. [2025-03-04 01:16:15,197 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1061 transitions. Word has length 101 [2025-03-04 01:16:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:15,197 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1061 transitions. [2025-03-04 01:16:15,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1061 transitions. [2025-03-04 01:16:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 01:16:15,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:15,198 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:15,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:16:15,199 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:15,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1358016145, now seen corresponding path program 1 times [2025-03-04 01:16:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:15,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137763491] [2025-03-04 01:16:15,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:15,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 01:16:15,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 01:16:15,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:15,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137763491] [2025-03-04 01:16:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137763491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700436072] [2025-03-04 01:16:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:15,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:15,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:15,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:15,303 INFO L87 Difference]: Start difference. First operand 762 states and 1061 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:15,563 INFO L93 Difference]: Finished difference Result 1613 states and 2237 transitions. [2025-03-04 01:16:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:15,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-03-04 01:16:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:15,566 INFO L225 Difference]: With dead ends: 1613 [2025-03-04 01:16:15,566 INFO L226 Difference]: Without dead ends: 882 [2025-03-04 01:16:15,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:15,567 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 133 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:15,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1230 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-04 01:16:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 746. [2025-03-04 01:16:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 699 states have (on average 1.3762517882689556) internal successors, (962), 702 states have internal predecessors, (962), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1036 transitions. [2025-03-04 01:16:15,614 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1036 transitions. Word has length 102 [2025-03-04 01:16:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:15,615 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1036 transitions. [2025-03-04 01:16:15,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1036 transitions. [2025-03-04 01:16:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 01:16:15,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:15,616 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:15,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:16:15,616 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:15,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1460419149, now seen corresponding path program 1 times [2025-03-04 01:16:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:15,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325140892] [2025-03-04 01:16:15,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:15,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:15,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 01:16:15,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 01:16:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325140892] [2025-03-04 01:16:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325140892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187480302] [2025-03-04 01:16:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:15,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:15,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:15,720 INFO L87 Difference]: Start difference. First operand 746 states and 1036 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:15,963 INFO L93 Difference]: Finished difference Result 1729 states and 2396 transitions. [2025-03-04 01:16:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-03-04 01:16:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:15,969 INFO L225 Difference]: With dead ends: 1729 [2025-03-04 01:16:15,969 INFO L226 Difference]: Without dead ends: 1020 [2025-03-04 01:16:15,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:15,972 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 131 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:15,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1518 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-03-04 01:16:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 774. [2025-03-04 01:16:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 727 states have (on average 1.375515818431912) internal successors, (1000), 730 states have internal predecessors, (1000), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1074 transitions. [2025-03-04 01:16:16,024 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1074 transitions. Word has length 102 [2025-03-04 01:16:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:16,025 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1074 transitions. [2025-03-04 01:16:16,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1074 transitions. [2025-03-04 01:16:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 01:16:16,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:16,026 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:16,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:16:16,027 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:16,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1326996338, now seen corresponding path program 1 times [2025-03-04 01:16:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:16,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453278731] [2025-03-04 01:16:16,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:16,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 01:16:16,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 01:16:16,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:16:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453278731] [2025-03-04 01:16:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453278731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:16,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:16,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769995209] [2025-03-04 01:16:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:16,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:16,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:16,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:16,274 INFO L87 Difference]: Start difference. First operand 774 states and 1074 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:16,713 INFO L93 Difference]: Finished difference Result 1688 states and 2336 transitions. [2025-03-04 01:16:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:16:16,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2025-03-04 01:16:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:16,716 INFO L225 Difference]: With dead ends: 1688 [2025-03-04 01:16:16,717 INFO L226 Difference]: Without dead ends: 951 [2025-03-04 01:16:16,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:16:16,718 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 475 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:16,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1219 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-04 01:16:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 728. [2025-03-04 01:16:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 681 states have (on average 1.3744493392070485) internal successors, (936), 684 states have internal predecessors, (936), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1010 transitions. [2025-03-04 01:16:16,768 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1010 transitions. Word has length 102 [2025-03-04 01:16:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:16,769 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1010 transitions. [2025-03-04 01:16:16,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1010 transitions. [2025-03-04 01:16:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:16:16,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:16,770 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:16:16,770 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 326184540, now seen corresponding path program 1 times [2025-03-04 01:16:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655894660] [2025-03-04 01:16:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:16,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:16:16,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:16:16,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:16,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655894660] [2025-03-04 01:16:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655894660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:16,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:16,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904089779] [2025-03-04 01:16:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:16,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:16,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:16,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:16,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:16,907 INFO L87 Difference]: Start difference. First operand 728 states and 1010 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:17,158 INFO L93 Difference]: Finished difference Result 1683 states and 2329 transitions. [2025-03-04 01:16:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:17,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2025-03-04 01:16:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:17,165 INFO L225 Difference]: With dead ends: 1683 [2025-03-04 01:16:17,165 INFO L226 Difference]: Without dead ends: 992 [2025-03-04 01:16:17,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:17,166 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 130 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:17,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1533 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-03-04 01:16:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 736. [2025-03-04 01:16:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 689 states have (on average 1.3730043541364296) internal successors, (946), 692 states have internal predecessors, (946), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1020 transitions. [2025-03-04 01:16:17,217 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1020 transitions. Word has length 103 [2025-03-04 01:16:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1020 transitions. [2025-03-04 01:16:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1020 transitions. [2025-03-04 01:16:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:16:17,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:17,218 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:17,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:16:17,218 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:17,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1833736349, now seen corresponding path program 1 times [2025-03-04 01:16:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390532845] [2025-03-04 01:16:17,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:17,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:16:17,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:16:17,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:17,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390532845] [2025-03-04 01:16:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390532845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047968314] [2025-03-04 01:16:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:17,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:17,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:17,584 INFO L87 Difference]: Start difference. First operand 736 states and 1020 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:18,047 INFO L93 Difference]: Finished difference Result 1831 states and 2537 transitions. [2025-03-04 01:16:18,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:16:18,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2025-03-04 01:16:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:18,053 INFO L225 Difference]: With dead ends: 1831 [2025-03-04 01:16:18,053 INFO L226 Difference]: Without dead ends: 1132 [2025-03-04 01:16:18,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:16:18,055 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 813 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:18,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 660 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-03-04 01:16:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 730. [2025-03-04 01:16:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 683 states have (on average 1.3733528550512446) internal successors, (938), 686 states have internal predecessors, (938), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1012 transitions. [2025-03-04 01:16:18,114 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1012 transitions. Word has length 103 [2025-03-04 01:16:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:18,115 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1012 transitions. [2025-03-04 01:16:18,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1012 transitions. [2025-03-04 01:16:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:16:18,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:18,116 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:18,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:16:18,116 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:18,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash -835178571, now seen corresponding path program 1 times [2025-03-04 01:16:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:18,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132539965] [2025-03-04 01:16:18,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:18,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:16:18,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:16:18,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:18,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132539965] [2025-03-04 01:16:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132539965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:16:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314842709] [2025-03-04 01:16:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:16:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:18,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:16:18,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:18,593 INFO L87 Difference]: Start difference. First operand 730 states and 1012 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:19,364 INFO L93 Difference]: Finished difference Result 2282 states and 3159 transitions. [2025-03-04 01:16:19,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:16:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2025-03-04 01:16:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:19,369 INFO L225 Difference]: With dead ends: 2282 [2025-03-04 01:16:19,369 INFO L226 Difference]: Without dead ends: 1589 [2025-03-04 01:16:19,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:16:19,370 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 531 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:19,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 2187 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:16:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2025-03-04 01:16:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 758. [2025-03-04 01:16:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 711 states have (on average 1.371308016877637) internal successors, (975), 714 states have internal predecessors, (975), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:16:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1049 transitions. [2025-03-04 01:16:19,426 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1049 transitions. Word has length 103 [2025-03-04 01:16:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:19,426 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1049 transitions. [2025-03-04 01:16:19,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1049 transitions. [2025-03-04 01:16:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:16:19,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:19,427 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:19,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:16:19,428 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:19,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:19,429 INFO L85 PathProgramCache]: Analyzing trace with hash -699754550, now seen corresponding path program 1 times [2025-03-04 01:16:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:19,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320638390] [2025-03-04 01:16:19,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:19,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:16:19,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:16:19,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:19,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:19,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320638390] [2025-03-04 01:16:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320638390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:16:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003062468] [2025-03-04 01:16:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:19,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:16:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:19,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:16:19,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:16:19,551 INFO L87 Difference]: Start difference. First operand 758 states and 1049 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:19,730 INFO L93 Difference]: Finished difference Result 1712 states and 2368 transitions. [2025-03-04 01:16:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:19,730 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2025-03-04 01:16:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:19,733 INFO L225 Difference]: With dead ends: 1712 [2025-03-04 01:16:19,733 INFO L226 Difference]: Without dead ends: 991 [2025-03-04 01:16:19,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:19,734 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 209 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:19,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 396 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-04 01:16:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 930. [2025-03-04 01:16:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 871 states have (on average 1.3662456946039037) internal successors, (1190), 874 states have internal predecessors, (1190), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:16:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1282 transitions. [2025-03-04 01:16:19,802 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1282 transitions. Word has length 103 [2025-03-04 01:16:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:19,802 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1282 transitions. [2025-03-04 01:16:19,803 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1282 transitions. [2025-03-04 01:16:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:16:19,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:19,803 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:19,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:16:19,804 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:19,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2071528985, now seen corresponding path program 1 times [2025-03-04 01:16:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:19,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960775220] [2025-03-04 01:16:19,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:19,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:16:19,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:16:19,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:19,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960775220] [2025-03-04 01:16:19,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960775220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:16:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901910184] [2025-03-04 01:16:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:19,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:16:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:19,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:16:19,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:19,994 INFO L87 Difference]: Start difference. First operand 930 states and 1282 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:20,540 INFO L93 Difference]: Finished difference Result 2318 states and 3169 transitions. [2025-03-04 01:16:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:16:20,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2025-03-04 01:16:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:20,544 INFO L225 Difference]: With dead ends: 2318 [2025-03-04 01:16:20,544 INFO L226 Difference]: Without dead ends: 1425 [2025-03-04 01:16:20,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:16:20,546 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 333 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:20,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 2007 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-03-04 01:16:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 959. [2025-03-04 01:16:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 900 states have (on average 1.3666666666666667) internal successors, (1230), 903 states have internal predecessors, (1230), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:16:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1322 transitions. [2025-03-04 01:16:20,619 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1322 transitions. Word has length 103 [2025-03-04 01:16:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:20,620 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1322 transitions. [2025-03-04 01:16:20,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1322 transitions. [2025-03-04 01:16:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:16:20,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:20,622 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:20,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:16:20,622 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:20,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1677500519, now seen corresponding path program 1 times [2025-03-04 01:16:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:20,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197014465] [2025-03-04 01:16:20,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:20,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:16:20,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:16:20,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:20,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:20,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197014465] [2025-03-04 01:16:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197014465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:20,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:16:20,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657713032] [2025-03-04 01:16:20,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:16:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:20,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:16:20,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:16:20,796 INFO L87 Difference]: Start difference. First operand 959 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:21,005 INFO L93 Difference]: Finished difference Result 1855 states and 2556 transitions. [2025-03-04 01:16:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:21,006 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2025-03-04 01:16:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:21,008 INFO L225 Difference]: With dead ends: 1855 [2025-03-04 01:16:21,009 INFO L226 Difference]: Without dead ends: 933 [2025-03-04 01:16:21,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:21,011 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 120 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:21,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 544 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-04 01:16:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 931. [2025-03-04 01:16:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 872 states have (on average 1.3669724770642202) internal successors, (1192), 875 states have internal predecessors, (1192), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:16:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1284 transitions. [2025-03-04 01:16:21,118 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1284 transitions. Word has length 103 [2025-03-04 01:16:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:21,118 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1284 transitions. [2025-03-04 01:16:21,118 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1284 transitions. [2025-03-04 01:16:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:16:21,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:21,119 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:16:21,119 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:21,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash -817527753, now seen corresponding path program 1 times [2025-03-04 01:16:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869380700] [2025-03-04 01:16:21,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:21,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:16:21,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:16:21,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:21,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869380700] [2025-03-04 01:16:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869380700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:16:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098970782] [2025-03-04 01:16:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:21,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:16:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:21,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:16:21,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:21,331 INFO L87 Difference]: Start difference. First operand 931 states and 1284 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:21,623 INFO L93 Difference]: Finished difference Result 1651 states and 2272 transitions. [2025-03-04 01:16:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:16:21,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-04 01:16:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:21,626 INFO L225 Difference]: With dead ends: 1651 [2025-03-04 01:16:21,626 INFO L226 Difference]: Without dead ends: 757 [2025-03-04 01:16:21,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:21,627 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 354 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:21,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 638 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-04 01:16:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 754. [2025-03-04 01:16:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 701 states have (on average 1.3523537803138375) internal successors, (948), 703 states have internal predecessors, (948), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1030 transitions. [2025-03-04 01:16:21,694 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1030 transitions. Word has length 104 [2025-03-04 01:16:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:21,694 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1030 transitions. [2025-03-04 01:16:21,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1030 transitions. [2025-03-04 01:16:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:16:21,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:21,695 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:21,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:16:21,695 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:21,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2000907541, now seen corresponding path program 1 times [2025-03-04 01:16:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888763029] [2025-03-04 01:16:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:21,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:16:21,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:16:21,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:21,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:21,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:21,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888763029] [2025-03-04 01:16:21,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888763029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:21,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:21,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014986778] [2025-03-04 01:16:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:21,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:21,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:21,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:21,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:21,929 INFO L87 Difference]: Start difference. First operand 754 states and 1030 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:22,219 INFO L93 Difference]: Finished difference Result 1349 states and 1843 transitions. [2025-03-04 01:16:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-04 01:16:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:22,222 INFO L225 Difference]: With dead ends: 1349 [2025-03-04 01:16:22,222 INFO L226 Difference]: Without dead ends: 761 [2025-03-04 01:16:22,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:16:22,223 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 261 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:22,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 744 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-04 01:16:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 684. [2025-03-04 01:16:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 631 states have (on average 1.3375594294770206) internal successors, (844), 633 states have internal predecessors, (844), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 926 transitions. [2025-03-04 01:16:22,285 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 926 transitions. Word has length 104 [2025-03-04 01:16:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:22,285 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 926 transitions. [2025-03-04 01:16:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 926 transitions. [2025-03-04 01:16:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:16:22,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:22,286 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:16:22,287 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:22,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash -786507946, now seen corresponding path program 1 times [2025-03-04 01:16:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78580337] [2025-03-04 01:16:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:22,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:16:22,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:16:22,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:22,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78580337] [2025-03-04 01:16:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78580337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:22,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:16:22,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763893636] [2025-03-04 01:16:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:22,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:22,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:22,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:22,410 INFO L87 Difference]: Start difference. First operand 684 states and 926 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:22,623 INFO L93 Difference]: Finished difference Result 1463 states and 1984 transitions. [2025-03-04 01:16:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:16:22,623 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-04 01:16:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:22,626 INFO L225 Difference]: With dead ends: 1463 [2025-03-04 01:16:22,626 INFO L226 Difference]: Without dead ends: 949 [2025-03-04 01:16:22,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:22,630 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 116 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:22,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 693 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-03-04 01:16:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 664. [2025-03-04 01:16:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 611 states have (on average 1.3387888707037643) internal successors, (818), 613 states have internal predecessors, (818), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 900 transitions. [2025-03-04 01:16:22,693 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 900 transitions. Word has length 104 [2025-03-04 01:16:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:22,694 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 900 transitions. [2025-03-04 01:16:22,694 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 900 transitions. [2025-03-04 01:16:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:16:22,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:22,694 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:22,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:16:22,695 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:22,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2012715706, now seen corresponding path program 1 times [2025-03-04 01:16:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:22,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900192346] [2025-03-04 01:16:22,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:22,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:22,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:16:22,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:16:22,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:22,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:16:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900192346] [2025-03-04 01:16:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900192346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660526887] [2025-03-04 01:16:22,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:22,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:16:22,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:16:22,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:16:22,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:16:22,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:22,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:22,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:16:22,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:22,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660526887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:22,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:16:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:16:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933628693] [2025-03-04 01:16:22,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:22,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:16:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:22,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:16:22,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:22,975 INFO L87 Difference]: Start difference. First operand 664 states and 900 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:23,077 INFO L93 Difference]: Finished difference Result 1303 states and 1764 transitions. [2025-03-04 01:16:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:16:23,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-04 01:16:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:23,082 INFO L225 Difference]: With dead ends: 1303 [2025-03-04 01:16:23,082 INFO L226 Difference]: Without dead ends: 676 [2025-03-04 01:16:23,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:23,083 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:23,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 547 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-04 01:16:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2025-03-04 01:16:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 623 states have (on average 1.332263242375602) internal successors, (830), 625 states have internal predecessors, (830), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 912 transitions. [2025-03-04 01:16:23,144 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 912 transitions. Word has length 104 [2025-03-04 01:16:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:23,144 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 912 transitions. [2025-03-04 01:16:23,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 912 transitions. [2025-03-04 01:16:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:16:23,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:23,145 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:23,152 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-04 01:16:23,345 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,SelfDestructingSolverStorable32 [2025-03-04 01:16:23,345 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:23,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash -187237006, now seen corresponding path program 1 times [2025-03-04 01:16:23,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:23,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066994459] [2025-03-04 01:16:23,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:23,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:16:23,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:16:23,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:23,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:24,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:24,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066994459] [2025-03-04 01:16:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066994459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:24,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451293107] [2025-03-04 01:16:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:24,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:24,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:24,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:24,126 INFO L87 Difference]: Start difference. First operand 676 states and 912 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:24,863 INFO L93 Difference]: Finished difference Result 1432 states and 1931 transitions. [2025-03-04 01:16:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:16:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-04 01:16:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:24,867 INFO L225 Difference]: With dead ends: 1432 [2025-03-04 01:16:24,867 INFO L226 Difference]: Without dead ends: 929 [2025-03-04 01:16:24,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:16:24,868 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 404 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:24,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1398 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-04 01:16:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 678. [2025-03-04 01:16:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 625 states have (on average 1.3312) internal successors, (832), 627 states have internal predecessors, (832), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 914 transitions. [2025-03-04 01:16:24,936 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 914 transitions. Word has length 104 [2025-03-04 01:16:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:24,936 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 914 transitions. [2025-03-04 01:16:24,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 914 transitions. [2025-03-04 01:16:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:16:24,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:24,937 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:24,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:16:24,937 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1575954906, now seen corresponding path program 1 times [2025-03-04 01:16:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155548310] [2025-03-04 01:16:24,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:24,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:24,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:16:24,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:16:24,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:24,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:25,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155548310] [2025-03-04 01:16:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155548310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:25,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:25,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459457032] [2025-03-04 01:16:25,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:25,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:25,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:25,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:25,079 INFO L87 Difference]: Start difference. First operand 678 states and 914 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:25,681 INFO L93 Difference]: Finished difference Result 2266 states and 3054 transitions. [2025-03-04 01:16:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:16:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-04 01:16:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:25,685 INFO L225 Difference]: With dead ends: 2266 [2025-03-04 01:16:25,685 INFO L226 Difference]: Without dead ends: 1605 [2025-03-04 01:16:25,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:16:25,686 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 299 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:25,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1955 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-04 01:16:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1164. [2025-03-04 01:16:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1079 states have (on average 1.3308619091751621) internal successors, (1436), 1082 states have internal predecessors, (1436), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:16:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1568 transitions. [2025-03-04 01:16:25,817 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1568 transitions. Word has length 104 [2025-03-04 01:16:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:25,817 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1568 transitions. [2025-03-04 01:16:25,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1568 transitions. [2025-03-04 01:16:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:16:25,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:25,818 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:25,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:16:25,818 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:25,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1690404208, now seen corresponding path program 1 times [2025-03-04 01:16:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412138968] [2025-03-04 01:16:25,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:25,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:16:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:16:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:25,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412138968] [2025-03-04 01:16:26,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412138968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:26,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:26,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764431687] [2025-03-04 01:16:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:26,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:26,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:26,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:26,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:26,006 INFO L87 Difference]: Start difference. First operand 1164 states and 1568 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:26,451 INFO L93 Difference]: Finished difference Result 2446 states and 3286 transitions. [2025-03-04 01:16:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:16:26,452 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2025-03-04 01:16:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:26,456 INFO L225 Difference]: With dead ends: 2446 [2025-03-04 01:16:26,456 INFO L226 Difference]: Without dead ends: 1835 [2025-03-04 01:16:26,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:16:26,458 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 139 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:26,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1678 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-04 01:16:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1158. [2025-03-04 01:16:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1073 states have (on average 1.330848089468779) internal successors, (1428), 1076 states have internal predecessors, (1428), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:16:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1560 transitions. [2025-03-04 01:16:26,587 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1560 transitions. Word has length 105 [2025-03-04 01:16:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:26,587 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1560 transitions. [2025-03-04 01:16:26,587 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1560 transitions. [2025-03-04 01:16:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:16:26,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:26,588 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:26,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:16:26,588 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:26,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -549669206, now seen corresponding path program 1 times [2025-03-04 01:16:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:26,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095954885] [2025-03-04 01:16:26,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:26,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:26,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095954885] [2025-03-04 01:16:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095954885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:26,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366654205] [2025-03-04 01:16:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:26,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:26,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:26,880 INFO L87 Difference]: Start difference. First operand 1158 states and 1560 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:27,309 INFO L93 Difference]: Finished difference Result 2272 states and 3055 transitions. [2025-03-04 01:16:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:27,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2025-03-04 01:16:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:27,312 INFO L225 Difference]: With dead ends: 2272 [2025-03-04 01:16:27,312 INFO L226 Difference]: Without dead ends: 1141 [2025-03-04 01:16:27,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:16:27,314 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 339 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:27,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 779 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-04 01:16:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 642. [2025-03-04 01:16:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 589 states have (on average 1.3259762308998302) internal successors, (781), 591 states have internal predecessors, (781), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 863 transitions. [2025-03-04 01:16:27,419 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 863 transitions. Word has length 106 [2025-03-04 01:16:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:27,419 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 863 transitions. [2025-03-04 01:16:27,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 863 transitions. [2025-03-04 01:16:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:16:27,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:27,420 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:27,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:16:27,420 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:27,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash 898315068, now seen corresponding path program 1 times [2025-03-04 01:16:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002208604] [2025-03-04 01:16:27,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:27,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:27,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:27,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:27,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:27,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002208604] [2025-03-04 01:16:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002208604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:27,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:16:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285310822] [2025-03-04 01:16:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:27,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:16:27,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:27,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:16:27,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:27,473 INFO L87 Difference]: Start difference. First operand 642 states and 863 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:27,562 INFO L93 Difference]: Finished difference Result 1251 states and 1682 transitions. [2025-03-04 01:16:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:16:27,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2025-03-04 01:16:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:27,565 INFO L225 Difference]: With dead ends: 1251 [2025-03-04 01:16:27,565 INFO L226 Difference]: Without dead ends: 646 [2025-03-04 01:16:27,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:27,566 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:27,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-04 01:16:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2025-03-04 01:16:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 593 states have (on average 1.3237774030354132) internal successors, (785), 595 states have internal predecessors, (785), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 867 transitions. [2025-03-04 01:16:27,667 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 867 transitions. Word has length 106 [2025-03-04 01:16:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:27,667 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 867 transitions. [2025-03-04 01:16:27,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 867 transitions. [2025-03-04 01:16:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:16:27,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:27,669 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:27,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 01:16:27,669 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2071730486, now seen corresponding path program 1 times [2025-03-04 01:16:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607958496] [2025-03-04 01:16:27,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:27,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:27,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:27,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:27,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:28,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607958496] [2025-03-04 01:16:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607958496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:16:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30030991] [2025-03-04 01:16:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:28,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:16:28,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:28,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:16:28,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:16:28,929 INFO L87 Difference]: Start difference. First operand 646 states and 867 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:30,418 INFO L93 Difference]: Finished difference Result 861 states and 1147 transitions. [2025-03-04 01:16:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 01:16:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 106 [2025-03-04 01:16:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:30,420 INFO L225 Difference]: With dead ends: 861 [2025-03-04 01:16:30,420 INFO L226 Difference]: Without dead ends: 859 [2025-03-04 01:16:30,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:16:30,421 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 1105 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:30,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 1463 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:16:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-04 01:16:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 681. [2025-03-04 01:16:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 628 states have (on average 1.3248407643312101) internal successors, (832), 630 states have internal predecessors, (832), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:16:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 914 transitions. [2025-03-04 01:16:30,525 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 914 transitions. Word has length 106 [2025-03-04 01:16:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 914 transitions. [2025-03-04 01:16:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:16:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 914 transitions. [2025-03-04 01:16:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:16:30,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:30,526 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:30,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:16:30,526 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2072654007, now seen corresponding path program 1 times [2025-03-04 01:16:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311670678] [2025-03-04 01:16:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:30,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:30,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:30,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:16:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311670678] [2025-03-04 01:16:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311670678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95979179] [2025-03-04 01:16:30,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:30,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:30,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:30,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:16:30,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:16:30,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:31,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:31,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:31,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:31,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:16:31,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:31,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:16:31,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:16:31,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 01:16:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 01:16:31,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:16:31,502 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 32 treesize of output 28 [2025-03-04 01:16:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:16:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95979179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:16:31,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:16:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-03-04 01:16:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602050531] [2025-03-04 01:16:31,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:16:31,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 01:16:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:31,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 01:16:31,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:16:31,633 INFO L87 Difference]: Start difference. First operand 681 states and 914 transitions. Second operand has 25 states, 22 states have (on average 5.863636363636363) internal successors, (129), 23 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 01:16:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:32,225 INFO L93 Difference]: Finished difference Result 1312 states and 1747 transitions. [2025-03-04 01:16:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:16:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.863636363636363) internal successors, (129), 23 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 9 states have call successors, (27) Word has length 106 [2025-03-04 01:16:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:32,227 INFO L225 Difference]: With dead ends: 1312 [2025-03-04 01:16:32,227 INFO L226 Difference]: Without dead ends: 799 [2025-03-04 01:16:32,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:16:32,228 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 559 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:32,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1484 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-04 01:16:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 696. [2025-03-04 01:16:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 639 states have (on average 1.3192488262910798) internal successors, (843), 640 states have internal predecessors, (843), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 01:16:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 929 transitions. [2025-03-04 01:16:32,306 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 929 transitions. Word has length 106 [2025-03-04 01:16:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:32,307 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 929 transitions. [2025-03-04 01:16:32,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.863636363636363) internal successors, (129), 23 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 01:16:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 929 transitions. [2025-03-04 01:16:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:16:32,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:32,307 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:32,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:16:32,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 01:16:32,508 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:32,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1992672022, now seen corresponding path program 1 times [2025-03-04 01:16:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123358319] [2025-03-04 01:16:32,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:32,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:32,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:32,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:32,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123358319] [2025-03-04 01:16:32,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123358319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:32,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:32,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742605114] [2025-03-04 01:16:32,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:32,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:32,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:32,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:32,929 INFO L87 Difference]: Start difference. First operand 696 states and 929 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:33,231 INFO L93 Difference]: Finished difference Result 704 states and 936 transitions. [2025-03-04 01:16:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:16:33,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 106 [2025-03-04 01:16:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:33,233 INFO L225 Difference]: With dead ends: 704 [2025-03-04 01:16:33,234 INFO L226 Difference]: Without dead ends: 702 [2025-03-04 01:16:33,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:16:33,234 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 340 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:33,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1073 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-04 01:16:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2025-03-04 01:16:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 642 states have (on average 1.3177570093457944) internal successors, (846), 643 states have internal predecessors, (846), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 01:16:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 932 transitions. [2025-03-04 01:16:33,319 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 932 transitions. Word has length 106 [2025-03-04 01:16:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:33,320 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 932 transitions. [2025-03-04 01:16:33,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 932 transitions. [2025-03-04 01:16:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:16:33,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:33,320 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:33,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:16:33,320 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:33,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1993595543, now seen corresponding path program 1 times [2025-03-04 01:16:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:33,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802909314] [2025-03-04 01:16:33,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:33,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:33,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:33,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:33,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:33,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:16:33,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:16:33,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:16:33,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:16:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:16:33,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:16:33,425 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:16:33,425 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:16:33,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 01:16:33,430 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:33,537 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:16:33,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:16:33 BoogieIcfgContainer [2025-03-04 01:16:33,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:16:33,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:16:33,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:16:33,540 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:16:33,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:15:55" (3/4) ... [2025-03-04 01:16:33,543 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:16:33,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:16:33,544 INFO L158 Benchmark]: Toolchain (without parser) took 39189.29ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 122.7MB in the beginning and 106.7MB in the end (delta: 16.1MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. [2025-03-04 01:16:33,544 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:16:33,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.28ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:16:33,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.81ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:16:33,544 INFO L158 Benchmark]: Boogie Preprocessor took 73.38ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 99.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:16:33,544 INFO L158 Benchmark]: IcfgBuilder took 623.50ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 60.2MB in the end (delta: 39.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:16:33,544 INFO L158 Benchmark]: TraceAbstraction took 38210.32ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 59.3MB in the beginning and 106.7MB in the end (delta: -47.5MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2025-03-04 01:16:33,544 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 285.2MB. Free memory was 106.7MB in the beginning and 106.7MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:16:33,545 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.81ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.28ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.81ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.38ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 99.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 623.50ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 60.2MB in the end (delta: 39.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38210.32ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 59.3MB in the beginning and 106.7MB in the end (delta: -47.5MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 285.2MB. Free memory was 106.7MB in the beginning and 106.7MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32] float* float_Array_0_arrayfloat_Array_0arrayVar3_Pointer = &(float_Array_0[3]); [L33] float* float_Array_0_arrayfloat_Array_0arrayVar4_Pointer = &(float_Array_0[4]); [L34-L36] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L37] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L39-L41] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L39-L41] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L39-L41] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L42] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L43] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L44-L46] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L44-L46] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L44-L46] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L48] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L49] signed long int last_1_signed_long_int_Array_0_0_ = -8; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=0, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] EXPR signed_long_int_Array_0[0] [L96] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L82] float_Array_0[0] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L84] float_Array_0[2] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[2] [L85] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L85] EXPR float_Array_0[2] [L85] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L86] float_Array_0[3] = __VERIFIER_nondet_float() [L87] EXPR float_Array_0[3] [L87] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F [L87] EXPR float_Array_0[3] [L87] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] CALL assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] RET assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L88] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L89] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L90] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L91] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] RET updateVariables() [L108] CALL step() [L53] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L53] COND FALSE !((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) [L56] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L56] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)); [L58] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L58] COND TRUE ! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L59] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L59] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L67] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L67] (*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) [L68] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L68] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L68] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_1=200, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L68] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L68] signed long int stepLocal_0 = ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)); [L69] COND FALSE !(stepLocal_0 < -1) [L72] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L72] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L72] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) [L74] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L74] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L74] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L74] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L74] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_1=200, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L74] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_1=200, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L74] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) [L99] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1) [L99] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1 [L99] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1 [L99] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)))))) [L99] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L99] EXPR (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))) [L99] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar4_Pointer) [L99] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L99] EXPR ((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99-L100] return (((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.1s, OverallIterations: 42, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14549 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14547 mSDsluCounter, 47396 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39150 mSDsCounter, 1472 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17258 IncrementalHoareTripleChecker+Invalid, 18730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1472 mSolverCounterUnsat, 8246 mSDtfsCounter, 17258 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1139 GetRequests, 553 SyntacticMatches, 4 SemanticMatches, 582 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=35, InterpolantAutomatonStates: 461, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 10289 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 4580 NumberOfCodeBlocks, 4580 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4535 ConstructedInterpolants, 0 QuantifiedInterpolants, 27977 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1342 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 45 InterpolantComputations, 40 PerfectInterpolantSequences, 6333/6480 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:16:33,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.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 c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:16:35,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:16:35,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:16:35,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:16:35,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:16:35,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:16:35,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:16:35,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:16:35,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:16:35,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:16:35,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:16:35,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:16:35,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:16:35,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:16:35,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:16:35,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:16:35,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:16:35,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:16:35,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:16:35,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:16:35,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:16:35,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:16:35,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:16:35,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:16:35,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:35,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:16:35,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:16:35,500 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 -> c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d [2025-03-04 01:16:35,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:16:35,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:16:35,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:16:35,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:16:35,795 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:16:35,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2025-03-04 01:16:37,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77215226b/86d75451d0954dfb9d8d669a658c9285/FLAG6d6b61e24 [2025-03-04 01:16:37,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:16:37,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2025-03-04 01:16:37,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77215226b/86d75451d0954dfb9d8d669a658c9285/FLAG6d6b61e24 [2025-03-04 01:16:37,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77215226b/86d75451d0954dfb9d8d669a658c9285 [2025-03-04 01:16:37,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:16:37,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:16:37,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:37,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:16:37,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:16:37,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7788b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37, skipping insertion in model container [2025-03-04 01:16:37,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:16:37,361 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-ap_file-33.i[917,930] [2025-03-04 01:16:37,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:37,449 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:16:37,459 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-ap_file-33.i[917,930] [2025-03-04 01:16:37,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:37,512 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:16:37,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37 WrapperNode [2025-03-04 01:16:37,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:37,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:37,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:16:37,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:16:37,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,567 INFO L138 Inliner]: procedures = 36, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 423 [2025-03-04 01:16:37,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:37,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:16:37,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:16:37,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:16:37,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,607 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 44, 21, 11, 31]. 38 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 2, 2]. The 15 writes are split as follows [0, 1, 5, 4, 3, 2]. [2025-03-04 01:16:37,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:16:37,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:16:37,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:16:37,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:16:37,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (1/1) ... [2025-03-04 01:16:37,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:37,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:37,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:16:37,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:16:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:16:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:16:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:16:37,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:16:37,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:16:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:16:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:16:37,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:16:37,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:16:42,327 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite75#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite94#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short97#1;havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short116#1; [2025-03-04 01:16:42,363 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-04 01:16:42,363 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:16:42,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:16:42,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:16:42,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:42 BoogieIcfgContainer [2025-03-04 01:16:42,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:16:42,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:16:42,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:16:42,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:16:42,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:16:37" (1/3) ... [2025-03-04 01:16:42,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3c9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:42, skipping insertion in model container [2025-03-04 01:16:42,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:37" (2/3) ... [2025-03-04 01:16:42,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3c9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:42, skipping insertion in model container [2025-03-04 01:16:42,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:42" (3/3) ... [2025-03-04 01:16:42,381 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-33.i [2025-03-04 01:16:42,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:16:42,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-33.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:16:42,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:16:42,440 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;@1e454953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:16:42,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:16:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:16:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 01:16:42,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:42,450 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:42,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 334893500, now seen corresponding path program 1 times [2025-03-04 01:16:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276319702] [2025-03-04 01:16:42,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:42,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:16:42,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:42,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:16:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:16:42,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:16:42,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:16:42,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:42,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:42,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:16:42,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:16:42,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:42,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276319702] [2025-03-04 01:16:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276319702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:42,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:16:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900085897] [2025-03-04 01:16:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:42,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:16:42,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:42,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:16:42,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:16:42,864 INFO L87 Difference]: Start difference. First operand has 84 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:42,879 INFO L93 Difference]: Finished difference Result 162 states and 244 transitions. [2025-03-04 01:16:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:16:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-04 01:16:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:42,884 INFO L225 Difference]: With dead ends: 162 [2025-03-04 01:16:42,885 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 01:16:42,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:16:42,889 INFO L435 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:42,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 01:16:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 01:16:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:16:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-04 01:16:42,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 92 [2025-03-04 01:16:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:42,924 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-04 01:16:42,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:16:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-04 01:16:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 01:16:42,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:42,929 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:42,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:16:43,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:16:43,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:43,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:43,131 INFO L85 PathProgramCache]: Analyzing trace with hash 851461881, now seen corresponding path program 1 times [2025-03-04 01:16:43,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:43,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895622430] [2025-03-04 01:16:43,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:16:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:43,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:16:43,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:16:43,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:16:43,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:16:43,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:43,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:43,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:16:43,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:44,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:16:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 01:16:45,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:16:45,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:16:45,627 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 21 treesize of output 24 [2025-03-04 01:16:45,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895622430] [2025-03-04 01:16:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895622430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2115066055] [2025-03-04 01:16:45,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:16:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:16:45,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:16:45,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-04 01:16:45,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:16:46,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:16:46,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:46,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:46,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:16:46,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:46,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2115066055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:46,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:16:46,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2025-03-04 01:16:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834522154] [2025-03-04 01:16:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:46,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:46,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:46,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:46,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:16:46,220 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:46,288 INFO L93 Difference]: Finished difference Result 166 states and 237 transitions. [2025-03-04 01:16:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:16:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-04 01:16:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:46,289 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:16:46,290 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:16:46,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:16:46,291 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:46,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:16:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-04 01:16:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:16:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-03-04 01:16:46,297 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 92 [2025-03-04 01:16:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-03-04 01:16:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-03-04 01:16:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 01:16:46,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:46,299 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:46,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-04 01:16:46,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:16:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:16:46,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:46,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1738965562, now seen corresponding path program 1 times [2025-03-04 01:16:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857824009] [2025-03-04 01:16:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:46,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:16:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:46,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:16:46,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:16:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:16:46,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:16:46,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:46,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:16:46,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:47,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:16:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 01:16:48,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:16:48,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:16:48,773 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 21 treesize of output 24 [2025-03-04 01:16:48,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857824009] [2025-03-04 01:16:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857824009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [516469476] [2025-03-04 01:16:48,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:16:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:16:48,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:16:48,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-04 01:16:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:16:49,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:16:49,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:49,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:49,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:16:49,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:16:49,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [516469476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:49,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:16:49,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-03-04 01:16:49,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084427423] [2025-03-04 01:16:49,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:49,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:16:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:49,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:16:49,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:16:49,366 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:49,444 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2025-03-04 01:16:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:16:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-04 01:16:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:49,445 INFO L225 Difference]: With dead ends: 174 [2025-03-04 01:16:49,445 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 01:16:49,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:16:49,446 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:49,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 01:16:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-04 01:16:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:16:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2025-03-04 01:16:49,451 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 92 [2025-03-04 01:16:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:49,451 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2025-03-04 01:16:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:16:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2025-03-04 01:16:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 01:16:49,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:49,453 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:49,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:16:49,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-04 01:16:49,853 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:16:49,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:49,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1739889083, now seen corresponding path program 1 times [2025-03-04 01:16:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288263505] [2025-03-04 01:16:49,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:16:49,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:49,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:16:49,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:16:49,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:16:50,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:16:50,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:50,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:50,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:16:50,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:50,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:16:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 01:16:50,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:16:51,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:16:51,068 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 21 treesize of output 24 [2025-03-04 01:16:51,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288263505] [2025-03-04 01:16:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288263505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1328278143] [2025-03-04 01:16:51,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:51,170 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:16:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:16:51,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:16:51,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-04 01:16:51,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:16:51,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:16:51,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:51,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:16:51,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:52,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:16:53,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:16:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 01:16:53,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:16:53,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-04 01:16:53,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1328278143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:53,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:16:53,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-04 01:16:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815616843] [2025-03-04 01:16:53,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:16:53,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:16:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:53,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:16:53,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:16:53,885 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 17 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:16:59,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:17:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:00,055 INFO L93 Difference]: Finished difference Result 309 states and 423 transitions. [2025-03-04 01:17:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:17:00,057 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 92 [2025-03-04 01:17:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:00,058 INFO L225 Difference]: With dead ends: 309 [2025-03-04 01:17:00,058 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 01:17:00,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:17:00,059 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 576 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:00,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1080 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 276 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-04 01:17:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 01:17:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 134. [2025-03-04 01:17:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 112 states have internal predecessors, (148), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:17:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2025-03-04 01:17:00,086 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 92 [2025-03-04 01:17:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:00,087 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2025-03-04 01:17:00,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:17:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2025-03-04 01:17:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 01:17:00,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:00,088 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:00,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:17:00,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:17:00,488 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:00,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:00,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1310313732, now seen corresponding path program 1 times [2025-03-04 01:17:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:00,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973385459] [2025-03-04 01:17:00,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:00,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:00,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:00,493 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:17:00,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:17:00,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:17:00,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:17:00,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:00,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:00,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:17:00,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:00,748 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 77 treesize of output 41 [2025-03-04 01:17:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 01:17:00,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:00,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973385459] [2025-03-04 01:17:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973385459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:17:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369453775] [2025-03-04 01:17:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:00,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:17:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:00,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:17:00,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:17:00,766 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:17:02,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:17:04,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:17:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:05,241 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2025-03-04 01:17:05,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:17:05,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-04 01:17:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:05,244 INFO L225 Difference]: With dead ends: 256 [2025-03-04 01:17:05,244 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:17:05,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:17:05,245 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 100 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:05,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 358 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 01:17:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:17:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2025-03-04 01:17:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:17:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2025-03-04 01:17:05,262 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 92 [2025-03-04 01:17:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:05,262 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2025-03-04 01:17:05,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:17:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2025-03-04 01:17:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:17:05,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:05,263 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:05,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:17:05,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:05,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:05,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash -968367110, now seen corresponding path program 1 times [2025-03-04 01:17:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967195014] [2025-03-04 01:17:05,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:05,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:05,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:05,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:17:05,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:17:05,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:17:05,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:17:05,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:05,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:05,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:17:05,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:05,764 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 95 treesize of output 41 [2025-03-04 01:17:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:17:05,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:05,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967195014] [2025-03-04 01:17:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967195014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:17:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741022983] [2025-03-04 01:17:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:17:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:17:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:17:05,782 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:17:06,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:17:10,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:17:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:10,140 INFO L93 Difference]: Finished difference Result 242 states and 326 transitions. [2025-03-04 01:17:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:17:10,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-03-04 01:17:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:10,142 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:17:10,142 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:17:10,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:17:10,143 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 86 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:10,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 351 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 01:17:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:17:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2025-03-04 01:17:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 112 states have internal predecessors, (144), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:17:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2025-03-04 01:17:10,157 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 94 [2025-03-04 01:17:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:10,158 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2025-03-04 01:17:10,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:17:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2025-03-04 01:17:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:17:10,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:10,158 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:10,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:17:10,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:10,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:10,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1618493576, now seen corresponding path program 1 times [2025-03-04 01:17:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:10,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031366792] [2025-03-04 01:17:10,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:10,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:10,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:10,362 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:17:10,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:17:10,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:17:10,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:17:10,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:10,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:10,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:17:10,575 INFO L279 TraceCheckSpWp]: Computing forward predicates...