./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.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 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:15:31,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:15:31,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:15:31,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:15:31,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:15:31,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:15:31,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:15:31,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:15:31,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:15:31,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:15:31,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:15:31,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:15:31,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:15:31,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:15:31,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:15:31,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:15:31,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:15:31,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:15:31,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:15:31,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:15:31,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:15:31,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:15:31,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:15:31,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:15:31,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:15:31,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:15:31,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:15:31,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:15:31,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:15:31,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:15:31,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:15:31,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:15:31,669 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 -> 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 [2025-03-08 16:15:31,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:15:31,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:15:31,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:15:31,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:15:31,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:15:31,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2025-03-08 16:15:32,992 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/595dba632/75e71c30da824b479472a5bcd1c761a9/FLAGa627043b2 [2025-03-08 16:15:33,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:15:33,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2025-03-08 16:15:33,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/595dba632/75e71c30da824b479472a5bcd1c761a9/FLAGa627043b2 [2025-03-08 16:15:33,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/595dba632/75e71c30da824b479472a5bcd1c761a9 [2025-03-08 16:15:33,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:15:33,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:15:33,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:15:33,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:15:33,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:15:33,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29785afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33, skipping insertion in model container [2025-03-08 16:15:33,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:15:33,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2025-03-08 16:15:33,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:15:33,765 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:15:33,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2025-03-08 16:15:33,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:15:33,840 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:15:33,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33 WrapperNode [2025-03-08 16:15:33,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:15:33,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:15:33,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:15:33,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:15:33,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,889 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-03-08 16:15:33,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:15:33,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:15:33,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:15:33,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:15:33,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,929 INFO L175 MemorySlicer]: Split 139 memory accesses to 6 slices as follows [2, 8, 40, 10, 22, 57]. 41 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 5, 1, 2, 4]. The 17 writes are split as follows [0, 1, 6, 3, 2, 5]. [2025-03-08 16:15:33,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:15:33,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:15:33,970 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:15:33,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:15:33,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (1/1) ... [2025-03-08 16:15:33,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:15:33,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:15:33,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:15:34,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:15:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:15:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:15:34,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:15:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:15:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:15:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:15:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:15:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:15:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:15:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:15:34,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:15:34,115 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:15:34,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:15:34,536 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem90#1;havoc property_#t~ite110#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~ite105#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite125#1;havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite144#1;havoc property_#t~mem133#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~bitwise132#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem143#1;havoc property_#t~mem138#1;havoc property_#t~ite141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem142#1;havoc property_#t~short145#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1; [2025-03-08 16:15:34,566 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-03-08 16:15:34,566 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:15:34,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:15:34,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:15:34,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:15:34 BoogieIcfgContainer [2025-03-08 16:15:34,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:15:34,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:15:34,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:15:34,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:15:34,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:15:33" (1/3) ... [2025-03-08 16:15:34,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bbc27dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:15:34, skipping insertion in model container [2025-03-08 16:15:34,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:33" (2/3) ... [2025-03-08 16:15:34,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bbc27dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:15:34, skipping insertion in model container [2025-03-08 16:15:34,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:15:34" (3/3) ... [2025-03-08 16:15:34,590 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-30.i [2025-03-08 16:15:34,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:15:34,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-30.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:15:34,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:15:34,660 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;@7378e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:15:34,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:15:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:15:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:15:34,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:34,676 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:34,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:34,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1123525049, now seen corresponding path program 1 times [2025-03-08 16:15:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:34,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022919477] [2025-03-08 16:15:34,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:34,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:15:34,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:15:34,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:15:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022919477] [2025-03-08 16:15:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022919477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:15:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058979354] [2025-03-08 16:15:34,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:34,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:15:34,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:15:34,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:15:34,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:15:35,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:15:35,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:15:35,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:35,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:35,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:15:35,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:15:35,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058979354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:15:35,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:15:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278362014] [2025-03-08 16:15:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:35,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:15:35,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:35,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:15:35,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:15:35,185 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:35,212 INFO L93 Difference]: Finished difference Result 232 states and 358 transitions. [2025-03-08 16:15:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:15:35,214 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2025-03-08 16:15:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:35,218 INFO L225 Difference]: With dead ends: 232 [2025-03-08 16:15:35,219 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 16:15:35,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:15:35,222 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:35,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:35,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 16:15:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-08 16:15:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:15:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-03-08 16:15:35,255 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 138 [2025-03-08 16:15:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:35,255 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-03-08 16:15:35,255 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-03-08 16:15:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:15:35,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:35,257 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:35,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:15:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:15:35,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1540493636, now seen corresponding path program 1 times [2025-03-08 16:15:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852435570] [2025-03-08 16:15:35,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:35,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:15:35,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:15:35,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:35,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:35,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852435570] [2025-03-08 16:15:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852435570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:35,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:15:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266480236] [2025-03-08 16:15:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:35,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:15:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:35,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:15:35,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:15:35,760 INFO L87 Difference]: Start difference. First operand 116 states and 168 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:35,808 INFO L93 Difference]: Finished difference Result 232 states and 337 transitions. [2025-03-08 16:15:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:15:35,809 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-03-08 16:15:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:35,812 INFO L225 Difference]: With dead ends: 232 [2025-03-08 16:15:35,813 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 16:15:35,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:15:35,814 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:35,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 480 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 16:15:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-08 16:15:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:15:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2025-03-08 16:15:35,830 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 138 [2025-03-08 16:15:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:35,831 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2025-03-08 16:15:35,831 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2025-03-08 16:15:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:15:35,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:35,832 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:35,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:15:35,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1539570115, now seen corresponding path program 1 times [2025-03-08 16:15:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583609166] [2025-03-08 16:15:35,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:35,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:15:35,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:15:35,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:35,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583609166] [2025-03-08 16:15:36,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583609166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:36,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:36,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:15:36,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245612559] [2025-03-08 16:15:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:36,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:15:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:36,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:15:36,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:15:36,999 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:37,517 INFO L93 Difference]: Finished difference Result 416 states and 598 transitions. [2025-03-08 16:15:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:15:37,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2025-03-08 16:15:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:37,520 INFO L225 Difference]: With dead ends: 416 [2025-03-08 16:15:37,521 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 16:15:37,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:15:37,523 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 263 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:37,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1193 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:15:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 16:15:37,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 214. [2025-03-08 16:15:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 183 states have (on average 1.3825136612021858) internal successors, (253), 184 states have internal predecessors, (253), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:15:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 309 transitions. [2025-03-08 16:15:37,542 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 309 transitions. Word has length 138 [2025-03-08 16:15:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:37,542 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 309 transitions. [2025-03-08 16:15:37,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 309 transitions. [2025-03-08 16:15:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:15:37,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:37,544 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:37,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:15:37,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:37,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2083682640, now seen corresponding path program 1 times [2025-03-08 16:15:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386444271] [2025-03-08 16:15:37,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:37,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:15:37,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:15:37,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:37,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:38,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386444271] [2025-03-08 16:15:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386444271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:15:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050876407] [2025-03-08 16:15:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:38,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:15:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:38,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:15:38,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:15:38,311 INFO L87 Difference]: Start difference. First operand 214 states and 309 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:38,672 INFO L93 Difference]: Finished difference Result 740 states and 1062 transitions. [2025-03-08 16:15:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:15:38,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:15:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:38,677 INFO L225 Difference]: With dead ends: 740 [2025-03-08 16:15:38,677 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 16:15:38,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:15:38,678 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 222 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:38,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1245 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:15:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 16:15:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 373. [2025-03-08 16:15:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 330 states have (on average 1.393939393939394) internal successors, (460), 333 states have internal predecessors, (460), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:15:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 536 transitions. [2025-03-08 16:15:38,714 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 536 transitions. Word has length 139 [2025-03-08 16:15:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:38,715 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 536 transitions. [2025-03-08 16:15:38,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 536 transitions. [2025-03-08 16:15:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:15:38,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:38,718 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:38,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:15:38,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:38,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1705726031, now seen corresponding path program 1 times [2025-03-08 16:15:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838558654] [2025-03-08 16:15:38,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:38,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:15:38,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:15:38,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:38,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:39,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838558654] [2025-03-08 16:15:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838558654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:39,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:39,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:15:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145276897] [2025-03-08 16:15:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:39,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:15:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:39,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:15:39,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:15:39,428 INFO L87 Difference]: Start difference. First operand 373 states and 536 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:39,657 INFO L93 Difference]: Finished difference Result 750 states and 1077 transitions. [2025-03-08 16:15:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:15:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:15:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:39,660 INFO L225 Difference]: With dead ends: 750 [2025-03-08 16:15:39,660 INFO L226 Difference]: Without dead ends: 380 [2025-03-08 16:15:39,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:15:39,662 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 233 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:39,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1049 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:15:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-08 16:15:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-03-08 16:15:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.3892215568862276) internal successors, (464), 337 states have internal predecessors, (464), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:15:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 540 transitions. [2025-03-08 16:15:39,682 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 540 transitions. Word has length 139 [2025-03-08 16:15:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:39,682 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 540 transitions. [2025-03-08 16:15:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 540 transitions. [2025-03-08 16:15:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:15:39,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:39,685 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:39,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:15:39,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:39,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -227358500, now seen corresponding path program 1 times [2025-03-08 16:15:39,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:39,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926308515] [2025-03-08 16:15:39,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:39,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:15:39,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:15:39,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:39,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:39,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:39,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926308515] [2025-03-08 16:15:39,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926308515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:39,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:39,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:15:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861129095] [2025-03-08 16:15:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:39,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:15:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:39,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:15:39,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:39,965 INFO L87 Difference]: Start difference. First operand 377 states and 540 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:40,041 INFO L93 Difference]: Finished difference Result 755 states and 1080 transitions. [2025-03-08 16:15:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:15:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:15:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:40,045 INFO L225 Difference]: With dead ends: 755 [2025-03-08 16:15:40,045 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 16:15:40,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:15:40,046 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 73 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:40,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1030 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:15:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 16:15:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2025-03-08 16:15:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.3832335329341316) internal successors, (462), 337 states have internal predecessors, (462), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:15:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2025-03-08 16:15:40,065 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 139 [2025-03-08 16:15:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:40,066 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2025-03-08 16:15:40,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2025-03-08 16:15:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:15:40,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:40,068 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:40,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:15:40,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:40,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2016865635, now seen corresponding path program 1 times [2025-03-08 16:15:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:40,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723930612] [2025-03-08 16:15:40,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:40,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:15:40,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:15:40,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:40,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:15:40,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723930612] [2025-03-08 16:15:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723930612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:15:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601060613] [2025-03-08 16:15:40,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:40,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:15:40,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:15:40,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:15:40,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:15:40,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:15:40,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:15:40,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:40,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:40,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:15:40,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:40,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601060613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:40,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:15:40,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-08 16:15:40,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709179813] [2025-03-08 16:15:40,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:40,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:15:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:40,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:15:40,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:15:40,387 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:40,427 INFO L93 Difference]: Finished difference Result 763 states and 1089 transitions. [2025-03-08 16:15:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:15:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:15:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:40,430 INFO L225 Difference]: With dead ends: 763 [2025-03-08 16:15:40,430 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 16:15:40,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:15:40,431 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:40,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 642 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 16:15:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2025-03-08 16:15:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 342 states have (on average 1.3742690058479532) internal successors, (470), 345 states have internal predecessors, (470), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:15:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 546 transitions. [2025-03-08 16:15:40,449 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 546 transitions. Word has length 141 [2025-03-08 16:15:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:40,449 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 546 transitions. [2025-03-08 16:15:40,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 546 transitions. [2025-03-08 16:15:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:15:40,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:40,452 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:40,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:15:40,653 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,SelfDestructingSolverStorable6 [2025-03-08 16:15:40,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:40,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1540394554, now seen corresponding path program 1 times [2025-03-08 16:15:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461965377] [2025-03-08 16:15:40,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:40,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:15:40,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:15:40,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:40,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:41,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461965377] [2025-03-08 16:15:41,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461965377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:41,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:41,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:15:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388921363] [2025-03-08 16:15:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:41,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:15:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:41,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:15:41,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:15:41,422 INFO L87 Difference]: Start difference. First operand 385 states and 546 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:41,826 INFO L93 Difference]: Finished difference Result 961 states and 1357 transitions. [2025-03-08 16:15:41,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:15:41,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-03-08 16:15:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:41,833 INFO L225 Difference]: With dead ends: 961 [2025-03-08 16:15:41,833 INFO L226 Difference]: Without dead ends: 579 [2025-03-08 16:15:41,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:15:41,834 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 288 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:41,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1215 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:15:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-08 16:15:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2025-03-08 16:15:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 342 states have (on average 1.368421052631579) internal successors, (468), 345 states have internal predecessors, (468), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:15:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 544 transitions. [2025-03-08 16:15:41,851 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 544 transitions. Word has length 141 [2025-03-08 16:15:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:41,851 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 544 transitions. [2025-03-08 16:15:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 544 transitions. [2025-03-08 16:15:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:15:41,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:41,853 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:41,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:15:41,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:41,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash 738537669, now seen corresponding path program 1 times [2025-03-08 16:15:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:41,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482178235] [2025-03-08 16:15:41,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:41,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:15:41,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:15:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:42,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:42,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482178235] [2025-03-08 16:15:42,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482178235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:42,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:15:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753415361] [2025-03-08 16:15:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:42,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:15:42,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:42,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:15:42,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:15:42,231 INFO L87 Difference]: Start difference. First operand 385 states and 544 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:42,472 INFO L93 Difference]: Finished difference Result 808 states and 1137 transitions. [2025-03-08 16:15:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:15:42,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:15:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:42,475 INFO L225 Difference]: With dead ends: 808 [2025-03-08 16:15:42,475 INFO L226 Difference]: Without dead ends: 426 [2025-03-08 16:15:42,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:15:42,476 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 117 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:42,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1241 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:15:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-08 16:15:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 341. [2025-03-08 16:15:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 296 states have (on average 1.3445945945945945) internal successors, (398), 298 states have internal predecessors, (398), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 16:15:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2025-03-08 16:15:42,493 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 141 [2025-03-08 16:15:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:42,493 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2025-03-08 16:15:42,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2025-03-08 16:15:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:15:42,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:42,495 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:42,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:15:42,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:42,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1363265652, now seen corresponding path program 1 times [2025-03-08 16:15:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:42,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656480174] [2025-03-08 16:15:42,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:15:42,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:15:42,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:42,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:15:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656480174] [2025-03-08 16:15:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656480174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:15:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854814357] [2025-03-08 16:15:43,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:43,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:15:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:15:43,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:15:43,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:15:43,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:15:43,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:15:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:43,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 16:15:43,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:43,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:15:43,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:15:43,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:15:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:15:43,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:15:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854814357] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:15:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:15:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15, 9] total 18 [2025-03-08 16:15:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002438118] [2025-03-08 16:15:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:43,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:15:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:43,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:15:43,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:15:43,582 INFO L87 Difference]: Start difference. First operand 341 states and 476 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:43,808 INFO L93 Difference]: Finished difference Result 883 states and 1229 transitions. [2025-03-08 16:15:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:15:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:15:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:43,813 INFO L225 Difference]: With dead ends: 883 [2025-03-08 16:15:43,814 INFO L226 Difference]: Without dead ends: 545 [2025-03-08 16:15:43,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:15:43,815 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 122 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:43,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1300 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:15:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-08 16:15:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 542. [2025-03-08 16:15:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 469 states have (on average 1.3347547974413647) internal successors, (626), 473 states have internal predecessors, (626), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-08 16:15:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 752 transitions. [2025-03-08 16:15:43,849 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 752 transitions. Word has length 143 [2025-03-08 16:15:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:43,849 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 752 transitions. [2025-03-08 16:15:43,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 752 transitions. [2025-03-08 16:15:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:15:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:43,851 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:43,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:15:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:15:44,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:44,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1742720309, now seen corresponding path program 1 times [2025-03-08 16:15:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568416180] [2025-03-08 16:15:44,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:44,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:15:44,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:15:44,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:44,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568416180] [2025-03-08 16:15:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568416180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:15:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430484470] [2025-03-08 16:15:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:15:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:44,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:15:44,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:15:44,219 INFO L87 Difference]: Start difference. First operand 542 states and 752 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:44,421 INFO L93 Difference]: Finished difference Result 1113 states and 1542 transitions. [2025-03-08 16:15:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:15:44,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:15:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:44,424 INFO L225 Difference]: With dead ends: 1113 [2025-03-08 16:15:44,424 INFO L226 Difference]: Without dead ends: 574 [2025-03-08 16:15:44,425 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-08 16:15:44,426 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 92 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:44,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 541 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:15:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-08 16:15:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 477. [2025-03-08 16:15:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 416 states have (on average 1.3317307692307692) internal successors, (554), 419 states have internal predecessors, (554), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:15:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 658 transitions. [2025-03-08 16:15:44,448 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 658 transitions. Word has length 143 [2025-03-08 16:15:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:44,449 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 658 transitions. [2025-03-08 16:15:44,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 658 transitions. [2025-03-08 16:15:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:15:44,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:44,450 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:44,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:15:44,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:44,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1184566696, now seen corresponding path program 1 times [2025-03-08 16:15:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030974868] [2025-03-08 16:15:44,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:44,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:15:44,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:15:44,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:44,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030974868] [2025-03-08 16:15:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030974868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:44,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:44,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:15:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991327690] [2025-03-08 16:15:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:44,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:15:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:44,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:15:44,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:44,645 INFO L87 Difference]: Start difference. First operand 477 states and 658 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:44,705 INFO L93 Difference]: Finished difference Result 956 states and 1315 transitions. [2025-03-08 16:15:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:15:44,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2025-03-08 16:15:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:44,708 INFO L225 Difference]: With dead ends: 956 [2025-03-08 16:15:44,708 INFO L226 Difference]: Without dead ends: 482 [2025-03-08 16:15:44,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:15:44,709 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 70 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:44,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 776 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-08 16:15:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 441. [2025-03-08 16:15:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 383 states have internal predecessors, (503), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:15:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2025-03-08 16:15:44,732 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 144 [2025-03-08 16:15:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:44,732 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2025-03-08 16:15:44,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2025-03-08 16:15:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:15:44,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:44,734 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:44,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:15:44,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1993279414, now seen corresponding path program 1 times [2025-03-08 16:15:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347210294] [2025-03-08 16:15:44,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:44,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:15:44,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:15:44,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:44,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347210294] [2025-03-08 16:15:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347210294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:15:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317038871] [2025-03-08 16:15:44,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:44,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:15:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:44,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:15:44,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:44,971 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:45,033 INFO L93 Difference]: Finished difference Result 894 states and 1226 transitions. [2025-03-08 16:15:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:15:45,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-03-08 16:15:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:45,036 INFO L225 Difference]: With dead ends: 894 [2025-03-08 16:15:45,036 INFO L226 Difference]: Without dead ends: 456 [2025-03-08 16:15:45,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:15:45,037 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 96 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:45,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 623 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-08 16:15:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 430. [2025-03-08 16:15:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 369 states have (on average 1.3143631436314362) internal successors, (485), 372 states have internal predecessors, (485), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:15:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 589 transitions. [2025-03-08 16:15:45,056 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 589 transitions. Word has length 145 [2025-03-08 16:15:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:45,056 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 589 transitions. [2025-03-08 16:15:45,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 589 transitions. [2025-03-08 16:15:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:15:45,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:45,060 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:45,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:15:45,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash 632406634, now seen corresponding path program 1 times [2025-03-08 16:15:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893585781] [2025-03-08 16:15:45,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:45,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:45,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:15:45,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:15:45,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:45,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:15:45,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893585781] [2025-03-08 16:15:45,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893585781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:45,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:45,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:15:45,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72242906] [2025-03-08 16:15:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:45,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:15:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:15:45,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:15:45,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:45,257 INFO L87 Difference]: Start difference. First operand 430 states and 589 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:45,314 INFO L93 Difference]: Finished difference Result 875 states and 1196 transitions. [2025-03-08 16:15:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:15:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-03-08 16:15:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:45,317 INFO L225 Difference]: With dead ends: 875 [2025-03-08 16:15:45,317 INFO L226 Difference]: Without dead ends: 448 [2025-03-08 16:15:45,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:15:45,318 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 78 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:45,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 623 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-08 16:15:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 422. [2025-03-08 16:15:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 361 states have (on average 1.3130193905817173) internal successors, (474), 364 states have internal predecessors, (474), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:15:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 578 transitions. [2025-03-08 16:15:45,338 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 578 transitions. Word has length 145 [2025-03-08 16:15:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:45,339 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 578 transitions. [2025-03-08 16:15:45,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 578 transitions. [2025-03-08 16:15:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:15:45,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:45,340 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:45,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:15:45,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:45,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash -576959016, now seen corresponding path program 1 times [2025-03-08 16:15:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:15:45,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003513436] [2025-03-08 16:15:45,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:15:45,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:15:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:15:45,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:45,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:15:45,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505166104] [2025-03-08 16:15:45,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:45,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:15:45,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:15:45,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:15:45,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:15:45,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:15:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:15:45,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:45,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:15:45,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:15:45,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:15:45,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:15:45,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:45,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:15:45,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:15:45,934 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:15:45,935 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:15:45,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:15:46,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 16:15:46,138 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:46,224 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:15:46,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:15:46 BoogieIcfgContainer [2025-03-08 16:15:46,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:15:46,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:15:46,227 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:15:46,227 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:15:46,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:15:34" (3/4) ... [2025-03-08 16:15:46,230 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:15:46,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:15:46,231 INFO L158 Benchmark]: Toolchain (without parser) took 12669.70ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 122.7MB in the beginning and 328.3MB in the end (delta: -205.6MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2025-03-08 16:15:46,231 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:15:46,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.71ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 106.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:15:46,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:15:46,232 INFO L158 Benchmark]: Boogie Preprocessor took 79.17ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 97.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:15:46,232 INFO L158 Benchmark]: IcfgBuilder took 612.65ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 59.4MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:15:46,232 INFO L158 Benchmark]: TraceAbstraction took 11641.63ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 58.6MB in the beginning and 328.4MB in the end (delta: -269.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:15:46,232 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 427.8MB. Free memory was 328.4MB in the beginning and 328.3MB in the end (delta: 133.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:15:46,233 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.71ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 106.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.17ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 97.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 612.65ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 59.4MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11641.63ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 58.6MB in the beginning and 328.4MB in the end (delta: -269.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 427.8MB. Free memory was 328.4MB in the beginning and 328.3MB in the end (delta: 133.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someUnaryFLOAToperation at line 105, overapproximation of someUnaryFLOAToperation at line 69, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 0 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 0 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { -32, 8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { -32, 8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { -32, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = 0; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR signed_long_int_Array_0[0] [L102] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] float_Array_0[0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && 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}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[3] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[3] [L80] EXPR float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F [L80] EXPR float_Array_0[3] [L80] EXPR float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[3] >= -461168.6018427382800e+13F && 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[3] >= -461168.6018427382800e+13F && 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[3] >= -461168.6018427382800e+13F && 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}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[3] >= -461168.6018427382800e+13F && 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[4] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[4] [L82] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F [L82] EXPR float_Array_0[4] [L82] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L84] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] EXPR unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L113] RET updateVariables() [L114] CALL step() [L41] EXPR signed_short_int_Array_0[1] [L41] EXPR signed_short_int_Array_0[0] [L41] signed long int stepLocal_0 = (last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0]; [L42] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L47] EXPR unsigned_char_Array_0[0][0] [L47] unsigned_char_Array_0[1][1] = unsigned_char_Array_0[0][0] [L49] EXPR unsigned_char_Array_0[1][1] [L49] unsigned char stepLocal_2 = unsigned_char_Array_0[1][1]; [L50] EXPR unsigned_char_Array_0[1][1] [L50] EXPR unsigned_char_Array_0[1][1] [L50] signed long int stepLocal_1 = unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]; [L51] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] COND FALSE !(stepLocal_1 < signed_short_int_Array_0[0]) [L60] EXPR unsigned_char_Array_0[0][0] [L60] signed_long_int_Array_0[0] = unsigned_char_Array_0[0][0] [L62] EXPR unsigned_char_Array_0[1][1] [L62] unsigned char stepLocal_4 = unsigned_char_Array_0[1][1]; [L63] EXPR unsigned_char_Array_0[0][0] [L63] EXPR signed_short_int_Array_0[1] [L63] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L63] EXPR (unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, stepLocal_2=-129, stepLocal_4=-129, unsigned_char_Array_0={8:0}] [L63] signed long int stepLocal_3 = (unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0]; [L64] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L64] COND FALSE !(stepLocal_4 > signed_long_int_Array_0[0]) [L69] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L69] EXPR float_Array_0[0] [L69] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, stepLocal_2=-129, stepLocal_3=0, unsigned_char_Array_0={8:0}] [L69] EXPR float_Array_0[4] [L69] float_Array_0[1] = (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]) [L71] EXPR float_Array_0[4] [L71] float_Array_0[2] = float_Array_0[4] [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0])) [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR unsigned_char_Array_0[0][0] [L105] EXPR BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0]))) [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])) [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR unsigned_char_Array_0[0][0] [L105] EXPR ((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4])))) [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))) [L105] EXPR float_Array_0[1] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L105] EXPR float_Array_0[0] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR float_Array_0[4] [L105] EXPR (unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))))) && (float_Array_0[2] == ((float) float_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))))) && (float_Array_0[2] == ((float) float_Array_0[4])) [L105] EXPR float_Array_0[2] [L105] EXPR float_Array_0[4] [L105] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))))) && (float_Array_0[2] == ((float) float_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105-L106] return (((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))))) && (float_Array_0[2] == ((float) float_Array_0[4])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 190 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 15, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1663 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1655 mSDsluCounter, 12124 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9372 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2666 IncrementalHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 2752 mSDtfsCounter, 2666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542occurred in iteration=10, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 727 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2686 NumberOfCodeBlocks, 2686 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2521 ConstructedInterpolants, 0 QuantifiedInterpolants, 5559 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1422 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 9652/9792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:15:46,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.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 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:15:48,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:15:48,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:15:48,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:15:48,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:15:48,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:15:48,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:15:48,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:15:48,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:15:48,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:15:48,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:15:48,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:15:48,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:15:48,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:15:48,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:15:48,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:15:48,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:15:48,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:15:48,159 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:15:48,159 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:15:48,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:15:48,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:15:48,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:15:48,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:15:48,160 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 -> 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 [2025-03-08 16:15:48,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:15:48,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:15:48,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:15:48,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:15:48,384 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:15:48,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2025-03-08 16:15:49,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae25f9b6c/8ef6c1d257264aa588032067562912ad/FLAG027d985c2 [2025-03-08 16:15:49,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:15:49,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2025-03-08 16:15:49,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae25f9b6c/8ef6c1d257264aa588032067562912ad/FLAG027d985c2 [2025-03-08 16:15:50,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae25f9b6c/8ef6c1d257264aa588032067562912ad [2025-03-08 16:15:50,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:15:50,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:15:50,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:15:50,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:15:50,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:15:50,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff1a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50, skipping insertion in model container [2025-03-08 16:15:50,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:15:50,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2025-03-08 16:15:50,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:15:50,245 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:15:50,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2025-03-08 16:15:50,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:15:50,300 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:15:50,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50 WrapperNode [2025-03-08 16:15:50,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:15:50,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:15:50,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:15:50,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:15:50,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,344 INFO L138 Inliner]: procedures = 36, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2025-03-08 16:15:50,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:15:50,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:15:50,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:15:50,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:15:50,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,377 INFO L175 MemorySlicer]: Split 139 memory accesses to 6 slices as follows [2, 8, 40, 10, 22, 57]. 41 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 5, 1, 2, 4]. The 17 writes are split as follows [0, 1, 6, 3, 2, 5]. [2025-03-08 16:15:50,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:15:50,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:15:50,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:15:50,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:15:50,409 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (1/1) ... [2025-03-08 16:15:50,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:15:50,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:15:50,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:15:50,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:15:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:15:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:15:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:15:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:15:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:15:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:15:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:15:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:15:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:15:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:15:50,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:15:50,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:15:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:15:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:15:50,625 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:15:50,626 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:15:51,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem89#1;havoc property_#t~ite109#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem97#1;havoc property_#t~ite104#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite124#1;havoc property_#t~mem113#1;havoc property_#t~ite121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite142#1;havoc property_#t~mem131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite135#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem141#1;havoc property_#t~mem136#1;havoc property_#t~ite139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem140#1;havoc property_#t~short143#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~short146#1; [2025-03-08 16:15:51,461 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-03-08 16:15:51,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:15:51,487 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:15:51,488 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:15:51,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:15:51 BoogieIcfgContainer [2025-03-08 16:15:51,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:15:51,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:15:51,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:15:51,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:15:51,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:15:50" (1/3) ... [2025-03-08 16:15:51,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682d4d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:15:51, skipping insertion in model container [2025-03-08 16:15:51,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:15:50" (2/3) ... [2025-03-08 16:15:51,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682d4d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:15:51, skipping insertion in model container [2025-03-08 16:15:51,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:15:51" (3/3) ... [2025-03-08 16:15:51,496 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-30.i [2025-03-08 16:15:51,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:15:51,507 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-30.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:15:51,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:15:51,555 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;@6587c695, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:15:51,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:15:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 95 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:15:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:15:51,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:51,567 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:51,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:51,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1419963922, now seen corresponding path program 1 times [2025-03-08 16:15:51,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:51,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148915397] [2025-03-08 16:15:51,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:51,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:51,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:15:51,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:15:51,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:15:51,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:15:51,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:51,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:51,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:15:51,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 16:15:51,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:51,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:15:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148915397] [2025-03-08 16:15:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148915397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:51,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:51,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:15:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375826436] [2025-03-08 16:15:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:15:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:15:51,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:15:51,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:15:51,984 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 95 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:52,002 INFO L93 Difference]: Finished difference Result 222 states and 344 transitions. [2025-03-08 16:15:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:15:52,007 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-08 16:15:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:52,014 INFO L225 Difference]: With dead ends: 222 [2025-03-08 16:15:52,014 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 16:15:52,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:15:52,020 INFO L435 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:52,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 16:15:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 16:15:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:15:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-03-08 16:15:52,061 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 136 [2025-03-08 16:15:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:52,061 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-03-08 16:15:52,061 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-03-08 16:15:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:15:52,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:52,063 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:52,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:15:52,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:52,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:52,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1608107101, now seen corresponding path program 1 times [2025-03-08 16:15:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:52,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019142951] [2025-03-08 16:15:52,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:52,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:52,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:52,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:15:52,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:15:52,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:15:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:15:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:52,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:15:52,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:52,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:52,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:15:52,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019142951] [2025-03-08 16:15:52,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019142951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:52,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:52,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:15:52,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759199172] [2025-03-08 16:15:52,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:52,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:15:52,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:15:52,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:15:52,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:15:52,717 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:52,772 INFO L93 Difference]: Finished difference Result 224 states and 326 transitions. [2025-03-08 16:15:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:15:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-08 16:15:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:52,774 INFO L225 Difference]: With dead ends: 224 [2025-03-08 16:15:52,774 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 16:15:52,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:15:52,775 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:52,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 611 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:15:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 16:15:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-08 16:15:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:15:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2025-03-08 16:15:52,786 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 136 [2025-03-08 16:15:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:52,787 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2025-03-08 16:15:52,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2025-03-08 16:15:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:15:52,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:52,788 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:52,802 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 (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:15:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:52,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:52,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1607183580, now seen corresponding path program 1 times [2025-03-08 16:15:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759786155] [2025-03-08 16:15:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:52,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:52,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:15:52,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:15:53,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:15:53,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:15:53,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:53,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:53,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:15:53,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:53,435 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-08 16:15:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-08 16:15:53,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:53,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:15:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759786155] [2025-03-08 16:15:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759786155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:53,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:53,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:15:53,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593209995] [2025-03-08 16:15:53,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:53,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:15:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:15:53,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:15:53,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:53,465 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:54,123 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2025-03-08 16:15:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:15:54,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-08 16:15:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:54,125 INFO L225 Difference]: With dead ends: 228 [2025-03-08 16:15:54,125 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 16:15:54,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:15:54,126 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 135 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:54,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 505 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:15:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 16:15:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-08 16:15:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:15:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2025-03-08 16:15:54,138 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 136 [2025-03-08 16:15:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:54,138 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2025-03-08 16:15:54,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:15:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2025-03-08 16:15:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:15:54,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:54,139 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:54,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:15:54,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:54,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:54,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1892551966, now seen corresponding path program 1 times [2025-03-08 16:15:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943514124] [2025-03-08 16:15:54,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:54,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:54,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:54,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:15:54,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:15:54,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:15:54,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:15:54,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:54,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:54,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:15:54,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:54,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:15:54,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-03-08 16:15:54,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:15:54,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:15:54,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-08 16:15:54,880 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-08 16:15:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:54,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:54,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:15:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943514124] [2025-03-08 16:15:54,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943514124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:54,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:54,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:15:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27337965] [2025-03-08 16:15:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:54,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:15:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:15:54,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:15:54,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:15:54,903 INFO L87 Difference]: Start difference. First operand 115 states and 164 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:55,413 INFO L93 Difference]: Finished difference Result 404 states and 574 transitions. [2025-03-08 16:15:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:15:55,414 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-03-08 16:15:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:55,416 INFO L225 Difference]: With dead ends: 404 [2025-03-08 16:15:55,416 INFO L226 Difference]: Without dead ends: 292 [2025-03-08 16:15:55,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:55,417 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 241 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:55,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 877 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:15:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-08 16:15:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 205. [2025-03-08 16:15:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 175 states have internal predecessors, (237), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:15:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 293 transitions. [2025-03-08 16:15:55,434 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 293 transitions. Word has length 138 [2025-03-08 16:15:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:55,435 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 293 transitions. [2025-03-08 16:15:55,435 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2025-03-08 16:15:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:15:55,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:55,436 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:55,449 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 (5)] Forceful destruction successful, exit code 0 [2025-03-08 16:15:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:55,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:55,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 155229590, now seen corresponding path program 1 times [2025-03-08 16:15:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:55,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955214765] [2025-03-08 16:15:55,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:55,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:55,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:55,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:15:55,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:15:55,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:15:55,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:15:55,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:55,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:55,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:15:55,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:56,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 16:15:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-03-08 16:15:56,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:15:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:15:56,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:15:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955214765] [2025-03-08 16:15:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955214765] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:15:56,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:15:56,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 16:15:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323192988] [2025-03-08 16:15:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:56,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:15:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:15:56,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:15:56,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:15:56,409 INFO L87 Difference]: Start difference. First operand 205 states and 293 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:56,494 INFO L93 Difference]: Finished difference Result 411 states and 586 transitions. [2025-03-08 16:15:56,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:15:56,495 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:15:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:56,497 INFO L225 Difference]: With dead ends: 411 [2025-03-08 16:15:56,497 INFO L226 Difference]: Without dead ends: 209 [2025-03-08 16:15:56,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:15:56,498 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 68 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:56,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 675 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:15:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-08 16:15:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2025-03-08 16:15:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 175 states have internal predecessors, (236), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:15:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 292 transitions. [2025-03-08 16:15:56,512 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 292 transitions. Word has length 139 [2025-03-08 16:15:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:56,513 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 292 transitions. [2025-03-08 16:15:56,513 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:15:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 292 transitions. [2025-03-08 16:15:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:15:56,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:56,514 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:15:56,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 16:15:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:56,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash -266813334, now seen corresponding path program 1 times [2025-03-08 16:15:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223935312] [2025-03-08 16:15:56,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:56,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:56,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:56,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:15:56,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:15:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:15:57,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:15:57,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:57,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:57,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 16:15:57,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:57,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:15:57,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-08 16:15:57,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:15:57,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-03-08 16:15:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:15:57,924 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 23 treesize of output 15 [2025-03-08 16:15:57,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:15:57,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 37 [2025-03-08 16:15:59,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:15:59,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 62 [2025-03-08 16:15:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 282 proven. 27 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 16:15:59,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:16:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:01,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223935312] [2025-03-08 16:16:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223935312] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:16:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-03-08 16:16:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423990908] [2025-03-08 16:16:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:01,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:16:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:01,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:16:01,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:16:01,949 INFO L87 Difference]: Start difference. First operand 205 states and 292 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:07,374 INFO L93 Difference]: Finished difference Result 597 states and 843 transitions. [2025-03-08 16:16:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:16:07,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:16:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:07,381 INFO L225 Difference]: With dead ends: 597 [2025-03-08 16:16:07,381 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 16:16:07,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:16:07,383 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 725 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:07,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1316 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 16:16:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 16:16:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 282. [2025-03-08 16:16:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 245 states have (on average 1.3551020408163266) internal successors, (332), 247 states have internal predecessors, (332), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 16:16:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 398 transitions. [2025-03-08 16:16:07,403 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 398 transitions. Word has length 139 [2025-03-08 16:16:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:07,404 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 398 transitions. [2025-03-08 16:16:07,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 398 transitions. [2025-03-08 16:16:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:16:07,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:07,405 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:07,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 16:16:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:07,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:07,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 412116074, now seen corresponding path program 1 times [2025-03-08 16:16:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494265569] [2025-03-08 16:16:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:07,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:07,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:07,608 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:07,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 16:16:07,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:16:07,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:16:07,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:07,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:07,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:16:07,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:07,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:07,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494265569] [2025-03-08 16:16:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494265569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:07,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:16:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337384077] [2025-03-08 16:16:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:07,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:07,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:07,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:07,965 INFO L87 Difference]: Start difference. First operand 282 states and 398 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:08,007 INFO L93 Difference]: Finished difference Result 570 states and 805 transitions. [2025-03-08 16:16:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:08,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:16:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:08,009 INFO L225 Difference]: With dead ends: 570 [2025-03-08 16:16:08,009 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 16:16:08,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:08,010 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:08,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:16:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 16:16:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-03-08 16:16:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 252 states have (on average 1.3452380952380953) internal successors, (339), 254 states have internal predecessors, (339), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 16:16:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 405 transitions. [2025-03-08 16:16:08,025 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 405 transitions. Word has length 141 [2025-03-08 16:16:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:08,025 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 405 transitions. [2025-03-08 16:16:08,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2025-03-08 16:16:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:16:08,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:08,027 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:08,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-08 16:16:08,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:08,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:08,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash -706500959, now seen corresponding path program 1 times [2025-03-08 16:16:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:08,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202127018] [2025-03-08 16:16:08,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:08,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:08,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:08,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:08,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-08 16:16:08,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:16:08,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:16:08,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:08,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:08,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:16:08,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:16:08,777 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 23 treesize of output 15 [2025-03-08 16:16:09,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:16:09,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 54 [2025-03-08 16:16:09,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:16:09,929 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 47 treesize of output 29 [2025-03-08 16:16:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:10,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:10,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202127018] [2025-03-08 16:16:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202127018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:16:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148728813] [2025-03-08 16:16:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:16:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:10,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:16:10,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:16:10,421 INFO L87 Difference]: Start difference. First operand 289 states and 405 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:15,901 INFO L93 Difference]: Finished difference Result 1056 states and 1466 transitions. [2025-03-08 16:16:15,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:16:15,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:16:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:15,909 INFO L225 Difference]: With dead ends: 1056 [2025-03-08 16:16:15,909 INFO L226 Difference]: Without dead ends: 770 [2025-03-08 16:16:15,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:16:15,910 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 411 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:15,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1271 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 16:16:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-08 16:16:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 406. [2025-03-08 16:16:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 363 states have (on average 1.3526170798898072) internal successors, (491), 366 states have internal predecessors, (491), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:16:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 567 transitions. [2025-03-08 16:16:15,930 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 567 transitions. Word has length 141 [2025-03-08 16:16:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:15,930 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 567 transitions. [2025-03-08 16:16:15,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 567 transitions. [2025-03-08 16:16:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:16:15,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:15,932 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:15,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-08 16:16:16,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:16,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:16,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1217035136, now seen corresponding path program 1 times [2025-03-08 16:16:16,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:16,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152447924] [2025-03-08 16:16:16,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:16,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:16,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:16,135 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:16,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 16:16:16,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:16:16,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:16:16,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:16,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:16,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 16:16:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:16,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:16:16,525 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 23 treesize of output 15 [2025-03-08 16:16:16,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:16:16,639 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 59 treesize of output 29 [2025-03-08 16:16:16,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-08 16:16:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:16,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:16,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152447924] [2025-03-08 16:16:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152447924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:16,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:16:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679563981] [2025-03-08 16:16:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:16,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:16:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:16,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:16:16,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:16:16,695 INFO L87 Difference]: Start difference. First operand 406 states and 567 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:17,848 INFO L93 Difference]: Finished difference Result 1135 states and 1574 transitions. [2025-03-08 16:16:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:16:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:16:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:17,852 INFO L225 Difference]: With dead ends: 1135 [2025-03-08 16:16:17,852 INFO L226 Difference]: Without dead ends: 732 [2025-03-08 16:16:17,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:16:17,854 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 331 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:17,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1436 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 16:16:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-08 16:16:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 406. [2025-03-08 16:16:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 363 states have (on average 1.3526170798898072) internal successors, (491), 366 states have internal predecessors, (491), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:16:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 567 transitions. [2025-03-08 16:16:17,875 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 567 transitions. Word has length 141 [2025-03-08 16:16:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:17,875 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 567 transitions. [2025-03-08 16:16:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 567 transitions. [2025-03-08 16:16:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:16:17,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:17,876 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:17,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-08 16:16:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:18,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:18,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 139684220, now seen corresponding path program 1 times [2025-03-08 16:16:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030670281] [2025-03-08 16:16:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:18,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:18,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:18,079 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:18,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-08 16:16:18,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:16:18,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:16:18,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:18,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:18,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:16:18,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:18,368 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 17 treesize of output 13 [2025-03-08 16:16:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:18,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:18,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030670281] [2025-03-08 16:16:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030670281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:18,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:18,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:16:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227007336] [2025-03-08 16:16:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:18,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:16:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:18,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:16:18,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:16:18,428 INFO L87 Difference]: Start difference. First operand 406 states and 567 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:18,742 INFO L93 Difference]: Finished difference Result 850 states and 1183 transitions. [2025-03-08 16:16:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:16:18,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:16:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:18,744 INFO L225 Difference]: With dead ends: 850 [2025-03-08 16:16:18,744 INFO L226 Difference]: Without dead ends: 447 [2025-03-08 16:16:18,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:16:18,745 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 111 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:18,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 966 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:16:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-08 16:16:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 362. [2025-03-08 16:16:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 317 states have (on average 1.334384858044164) internal successors, (423), 319 states have internal predecessors, (423), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 16:16:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 501 transitions. [2025-03-08 16:16:18,758 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 501 transitions. Word has length 141 [2025-03-08 16:16:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:18,759 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 501 transitions. [2025-03-08 16:16:18,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 501 transitions. [2025-03-08 16:16:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:16:18,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:18,760 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:18,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-08 16:16:18,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:18,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash -984168297, now seen corresponding path program 1 times [2025-03-08 16:16:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083921654] [2025-03-08 16:16:18,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:18,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:18,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:18,963 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:18,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-08 16:16:19,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:16:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:16:19,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:19,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:16:19,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-03-08 16:16:19,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:16:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:19,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083921654] [2025-03-08 16:16:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083921654] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:19,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:16:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-08 16:16:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375725917] [2025-03-08 16:16:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:19,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:19,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:19,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:16:19,585 INFO L87 Difference]: Start difference. First operand 362 states and 501 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:19,676 INFO L93 Difference]: Finished difference Result 800 states and 1102 transitions. [2025-03-08 16:16:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-03-08 16:16:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:19,678 INFO L225 Difference]: With dead ends: 800 [2025-03-08 16:16:19,678 INFO L226 Difference]: Without dead ends: 441 [2025-03-08 16:16:19,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:16:19,679 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 63 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:19,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 637 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:16:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-08 16:16:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 356. [2025-03-08 16:16:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 311 states have (on average 1.3279742765273312) internal successors, (413), 313 states have internal predecessors, (413), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 16:16:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 491 transitions. [2025-03-08 16:16:19,692 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 491 transitions. Word has length 142 [2025-03-08 16:16:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 491 transitions. [2025-03-08 16:16:19,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 491 transitions. [2025-03-08 16:16:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:16:19,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:19,694 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:19,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-03-08 16:16:19,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:19,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:19,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:19,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1826926860, now seen corresponding path program 1 times [2025-03-08 16:16:19,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:19,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48418643] [2025-03-08 16:16:19,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:19,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:19,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:19,897 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:19,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-08 16:16:19,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:16:20,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:16:20,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:20,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:20,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 16:16:20,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:20,305 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 40 treesize of output 22 [2025-03-08 16:16:20,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-08 16:16:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:20,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:20,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48418643] [2025-03-08 16:16:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48418643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:20,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:20,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:16:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814399047] [2025-03-08 16:16:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:20,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:20,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:20,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:20,359 INFO L87 Difference]: Start difference. First operand 356 states and 491 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:20,922 INFO L93 Difference]: Finished difference Result 742 states and 1023 transitions. [2025-03-08 16:16:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:20,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-03-08 16:16:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:20,924 INFO L225 Difference]: With dead ends: 742 [2025-03-08 16:16:20,924 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 16:16:20,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:16:20,925 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 93 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:20,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 699 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:16:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 16:16:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 319. [2025-03-08 16:16:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 274 states have (on average 1.3175182481751824) internal successors, (361), 276 states have internal predecessors, (361), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 16:16:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 439 transitions. [2025-03-08 16:16:20,938 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 439 transitions. Word has length 142 [2025-03-08 16:16:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:20,938 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 439 transitions. [2025-03-08 16:16:20,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 439 transitions. [2025-03-08 16:16:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:16:20,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:20,939 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:20,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-08 16:16:21,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:21,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:21,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash -786759385, now seen corresponding path program 1 times [2025-03-08 16:16:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091522717] [2025-03-08 16:16:21,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:21,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:21,142 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:21,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-08 16:16:21,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:16:21,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:16:21,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:21,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:21,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:16:21,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:21,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:16:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:21,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:21,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091522717] [2025-03-08 16:16:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091522717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:21,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:21,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:16:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259926855] [2025-03-08 16:16:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:21,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:16:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:21,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:16:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:16:21,530 INFO L87 Difference]: Start difference. First operand 319 states and 439 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:21,878 INFO L93 Difference]: Finished difference Result 824 states and 1130 transitions. [2025-03-08 16:16:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:16:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:16:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:21,880 INFO L225 Difference]: With dead ends: 824 [2025-03-08 16:16:21,880 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 16:16:21,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:16:21,881 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 116 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:21,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1325 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:16:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 16:16:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 505. [2025-03-08 16:16:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 432 states have (on average 1.3055555555555556) internal successors, (564), 436 states have internal predecessors, (564), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-08 16:16:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 690 transitions. [2025-03-08 16:16:21,912 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 690 transitions. Word has length 143 [2025-03-08 16:16:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:21,912 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 690 transitions. [2025-03-08 16:16:21,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 690 transitions. [2025-03-08 16:16:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:16:21,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:21,914 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:21,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-08 16:16:22,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:22,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:22,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:22,115 INFO L85 PathProgramCache]: Analyzing trace with hash 648378690, now seen corresponding path program 1 times [2025-03-08 16:16:22,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:22,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520503613] [2025-03-08 16:16:22,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:22,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:22,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:22,118 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:22,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-08 16:16:22,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:16:22,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:16:22,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:22,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:22,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 16:16:22,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:22,508 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 41 treesize of output 23 [2025-03-08 16:16:22,512 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 23 treesize of output 15 [2025-03-08 16:16:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:22,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:22,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:22,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520503613] [2025-03-08 16:16:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520503613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:22,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:22,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:16:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786875109] [2025-03-08 16:16:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:22,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:22,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:22,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:22,556 INFO L87 Difference]: Start difference. First operand 505 states and 690 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:23,113 INFO L93 Difference]: Finished difference Result 1037 states and 1414 transitions. [2025-03-08 16:16:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:16:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:23,117 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 16:16:23,117 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 16:16:23,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:16:23,120 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 86 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:23,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 493 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:16:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 16:16:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 440. [2025-03-08 16:16:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 379 states have (on average 1.3034300791556728) internal successors, (494), 382 states have internal predecessors, (494), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:16:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 598 transitions. [2025-03-08 16:16:23,139 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 598 transitions. Word has length 143 [2025-03-08 16:16:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:23,139 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 598 transitions. [2025-03-08 16:16:23,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 598 transitions. [2025-03-08 16:16:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:16:23,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:23,140 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:23,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-03-08 16:16:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:23,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:23,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1292137169, now seen corresponding path program 1 times [2025-03-08 16:16:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582103354] [2025-03-08 16:16:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:23,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:23,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:23,343 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:23,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-03-08 16:16:23,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:16:23,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:16:23,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:23,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 16:16:23,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:28,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:16:28,106 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 41 treesize of output 21 [2025-03-08 16:16:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:29,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:29,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582103354] [2025-03-08 16:16:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582103354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:29,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:29,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:16:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781743168] [2025-03-08 16:16:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:29,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:16:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:29,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:16:29,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:16:29,173 INFO L87 Difference]: Start difference. First operand 440 states and 598 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:53,360 INFO L93 Difference]: Finished difference Result 1413 states and 1909 transitions. [2025-03-08 16:16:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:16:53,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 16:16:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:53,373 INFO L225 Difference]: With dead ends: 1413 [2025-03-08 16:16:53,373 INFO L226 Difference]: Without dead ends: 976 [2025-03-08 16:16:53,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:16:53,374 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 394 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:53,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1103 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 20.2s Time] [2025-03-08 16:16:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-08 16:16:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 601. [2025-03-08 16:16:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 521 states have (on average 1.310940499040307) internal successors, (683), 524 states have internal predecessors, (683), 69 states have call successors, (69), 10 states have call predecessors, (69), 10 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 16:16:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 821 transitions. [2025-03-08 16:16:53,396 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 821 transitions. Word has length 145 [2025-03-08 16:16:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:53,397 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 821 transitions. [2025-03-08 16:16:53,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 821 transitions. [2025-03-08 16:16:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:16:53,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:53,398 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:53,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-03-08 16:16:53,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:53,599 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:53,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:53,599 INFO L85 PathProgramCache]: Analyzing trace with hash 342107813, now seen corresponding path program 1 times [2025-03-08 16:16:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:53,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075042693] [2025-03-08 16:16:53,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:53,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:53,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:53,601 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:53,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-03-08 16:16:53,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:16:53,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:16:53,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:53,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:53,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:16:53,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-03-08 16:16:54,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:16:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:55,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:55,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075042693] [2025-03-08 16:16:55,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075042693] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:55,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:16:55,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-08 16:16:55,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432039535] [2025-03-08 16:16:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:55,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:55,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:55,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:55,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:16:55,051 INFO L87 Difference]: Start difference. First operand 601 states and 821 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:55,222 INFO L93 Difference]: Finished difference Result 1049 states and 1426 transitions. [2025-03-08 16:16:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:55,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 16:16:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:55,224 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 16:16:55,224 INFO L226 Difference]: Without dead ends: 612 [2025-03-08 16:16:55,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:16:55,225 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 86 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:55,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 460 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:16:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-08 16:16:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 588. [2025-03-08 16:16:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 508 states have (on average 1.3051181102362204) internal successors, (663), 511 states have internal predecessors, (663), 69 states have call successors, (69), 10 states have call predecessors, (69), 10 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 16:16:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 801 transitions. [2025-03-08 16:16:55,247 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 801 transitions. Word has length 145 [2025-03-08 16:16:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:55,247 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 801 transitions. [2025-03-08 16:16:55,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 801 transitions. [2025-03-08 16:16:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:16:55,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:55,248 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:55,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-03-08 16:16:55,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:55,449 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:55,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1327173435, now seen corresponding path program 1 times [2025-03-08 16:16:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:55,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023979411] [2025-03-08 16:16:55,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:55,452 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:55,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-03-08 16:16:55,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:16:55,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:16:55,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:55,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:55,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:16:55,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-03-08 16:16:56,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:16:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:56,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:56,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023979411] [2025-03-08 16:16:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023979411] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:56,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:16:56,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-08 16:16:56,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633780377] [2025-03-08 16:16:56,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:56,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:56,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:56,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:56,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:16:56,729 INFO L87 Difference]: Start difference. First operand 588 states and 801 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:56,956 INFO L93 Difference]: Finished difference Result 1028 states and 1394 transitions. [2025-03-08 16:16:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:56,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 16:16:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:56,959 INFO L225 Difference]: With dead ends: 1028 [2025-03-08 16:16:56,959 INFO L226 Difference]: Without dead ends: 604 [2025-03-08 16:16:56,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:16:56,960 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 34 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:56,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 608 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:16:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-08 16:16:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 580. [2025-03-08 16:16:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 500 states have (on average 1.304) internal successors, (652), 503 states have internal predecessors, (652), 69 states have call successors, (69), 10 states have call predecessors, (69), 10 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 16:16:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 790 transitions. [2025-03-08 16:16:56,993 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 790 transitions. Word has length 145 [2025-03-08 16:16:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:56,994 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 790 transitions. [2025-03-08 16:16:56,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:16:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 790 transitions. [2025-03-08 16:16:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:16:56,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:56,995 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:16:57,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-03-08 16:16:57,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:57,196 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:57,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2124999447, now seen corresponding path program 1 times [2025-03-08 16:16:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:16:57,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131826204] [2025-03-08 16:16:57,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:16:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:16:57,199 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:16:57,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-03-08 16:16:57,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:16:57,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:16:57,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:57,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:57,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:16:57,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:57,659 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 17 treesize of output 13 [2025-03-08 16:16:58,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:16:58,347 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 41 treesize of output 21 [2025-03-08 16:16:58,355 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-08 16:16:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:16:58,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:58,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:16:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131826204] [2025-03-08 16:16:58,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131826204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:58,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:58,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:16:58,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511830130] [2025-03-08 16:16:58,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:58,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:16:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:16:58,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:16:58,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:16:58,459 INFO L87 Difference]: Start difference. First operand 580 states and 790 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:17:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:00,182 INFO L93 Difference]: Finished difference Result 1215 states and 1640 transitions. [2025-03-08 16:17:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:17:00,183 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 16:17:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:00,185 INFO L225 Difference]: With dead ends: 1215 [2025-03-08 16:17:00,185 INFO L226 Difference]: Without dead ends: 799 [2025-03-08 16:17:00,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:17:00,186 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 332 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:00,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1074 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 16:17:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-08 16:17:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 587. [2025-03-08 16:17:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 507 states have (on average 1.2998027613412229) internal successors, (659), 510 states have internal predecessors, (659), 69 states have call successors, (69), 10 states have call predecessors, (69), 10 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 16:17:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 797 transitions. [2025-03-08 16:17:00,207 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 797 transitions. Word has length 145 [2025-03-08 16:17:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:00,207 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 797 transitions. [2025-03-08 16:17:00,208 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:17:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 797 transitions. [2025-03-08 16:17:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:17:00,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:00,209 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:00,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-03-08 16:17:00,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:17:00,409 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:00,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1080368915, now seen corresponding path program 1 times [2025-03-08 16:17:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:00,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394149725] [2025-03-08 16:17:00,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:00,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:17:00,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:00,412 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:17:00,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-03-08 16:17:00,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:17:00,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:17:00,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:00,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:00,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 16:17:00,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:01,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:17:03,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2025-03-08 16:17:03,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 65 [2025-03-08 16:17:03,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:03,889 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 219 treesize of output 75 [2025-03-08 16:17:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 244 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 16:17:04,160 INFO L312 TraceCheckSpWp]: Computing backward predicates...