./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 05:21:59,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:21:59,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:21:59,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:21:59,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:21:59,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:21:59,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:21:59,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:21:59,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:21:59,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:21:59,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:21:59,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:21:59,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:21:59,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:21:59,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:21:59,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:21:59,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:21:59,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:21:59,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:21:59,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:21:59,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:21:59,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:21:59,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:21:59,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:59,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:21:59,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:21:59,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:21:59,655 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-17 05:21:59,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:21:59,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:21:59,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:21:59,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:21:59,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:21:59,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-17 05:22:01,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bad634f/ce428ec668ff4c25af64c72ecbf32b5b/FLAG6d7da2afe [2025-03-17 05:22:01,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:22:01,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2025-03-17 05:22:01,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bad634f/ce428ec668ff4c25af64c72ecbf32b5b/FLAG6d7da2afe [2025-03-17 05:22:01,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bad634f/ce428ec668ff4c25af64c72ecbf32b5b [2025-03-17 05:22:01,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:22:01,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:22:01,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:01,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:22:01,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:22:01,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:01" (1/1) ... [2025-03-17 05:22:01,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721af818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:01, skipping insertion in model container [2025-03-17 05:22:01,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:01" (1/1) ... [2025-03-17 05:22:01,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:22:01,842 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-17 05:22:01,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:01,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:22:01,947 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-17 05:22:02,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:02,020 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:22:02,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02 WrapperNode [2025-03-17 05:22:02,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:02,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:02,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:22:02,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:22:02,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,096 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-03-17 05:22:02,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:02,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:22:02,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:22:02,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:22:02,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,144 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-17 05:22:02,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:22:02,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:22:02,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:22:02,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:22:02,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (1/1) ... [2025-03-17 05:22:02,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:02,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:02,215 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-17 05:22:02,217 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-17 05:22:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:22:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:22:02,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:22:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:22:02,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:22:02,384 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:22:02,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:22:02,824 INFO L1322 $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-17 05:22:02,864 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-17 05:22:02,864 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:22:02,883 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:22:02,883 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:22:02,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:02 BoogieIcfgContainer [2025-03-17 05:22:02,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:22:02,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:22:02,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:22:02,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:22:02,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:22:01" (1/3) ... [2025-03-17 05:22:02,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367d7da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:02, skipping insertion in model container [2025-03-17 05:22:02,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:02" (2/3) ... [2025-03-17 05:22:02,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367d7da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:02, skipping insertion in model container [2025-03-17 05:22:02,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:02" (3/3) ... [2025-03-17 05:22:02,891 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-30.i [2025-03-17 05:22:02,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:22:02,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-30.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:22:02,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:22:02,956 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;@222215fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:22:02,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:22:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 94 states have internal predecessors, (133), 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-17 05:22:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:22:02,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:02,971 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] [2025-03-17 05:22:02,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash -528636402, now seen corresponding path program 1 times [2025-03-17 05:22:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266373569] [2025-03-17 05:22:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:03,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:03,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:03,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:03,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:03,288 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-17 05:22:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266373569] [2025-03-17 05:22:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266373569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091549074] [2025-03-17 05:22:03,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:03,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:03,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:03,292 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-17 05:22:03,295 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-17 05:22:03,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:03,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:03,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:03,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:03,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:22:03,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:03,505 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-17 05:22:03,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091549074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:03,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:22:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310524380] [2025-03-17 05:22:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:22:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:03,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:22:03,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:22:03,525 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 94 states have internal predecessors, (133), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 05:22:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:03,550 INFO L93 Difference]: Finished difference Result 223 states and 349 transitions. [2025-03-17 05:22:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:22:03,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 133 [2025-03-17 05:22:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:03,558 INFO L225 Difference]: With dead ends: 223 [2025-03-17 05:22:03,558 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 05:22:03,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-17 05:22:03,562 INFO L435 NwaCegarLoop]: 161 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, 161 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-17 05:22:03,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 05:22:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 05:22:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 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-17 05:22:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2025-03-17 05:22:03,600 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 133 [2025-03-17 05:22:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2025-03-17 05:22:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 05:22:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2025-03-17 05:22:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:22:03,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:03,607 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] [2025-03-17 05:22:03,614 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-17 05:22:03,807 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-17 05:22:03,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash -716779581, now seen corresponding path program 1 times [2025-03-17 05:22:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215874252] [2025-03-17 05:22:03,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:03,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:03,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:03,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:03,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:04,127 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-17 05:22:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:04,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215874252] [2025-03-17 05:22:04,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215874252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:04,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:04,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937603685] [2025-03-17 05:22:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:04,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:04,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:04,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:04,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:04,134 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 05:22:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:04,184 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2025-03-17 05:22:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:04,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 133 [2025-03-17 05:22:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:04,188 INFO L225 Difference]: With dead ends: 224 [2025-03-17 05:22:04,188 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:22:04,188 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-17 05:22:04,189 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 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-17 05:22:04,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:22:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 05:22:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 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-17 05:22:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-03-17 05:22:04,210 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 133 [2025-03-17 05:22:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:04,211 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-03-17 05:22:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 05:22:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-03-17 05:22:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:22:04,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:04,213 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] [2025-03-17 05:22:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:22:04,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash -715856060, now seen corresponding path program 1 times [2025-03-17 05:22:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758574374] [2025-03-17 05:22:04,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:04,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:04,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:04,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:04,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:05,298 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-17 05:22:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758574374] [2025-03-17 05:22:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758574374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:22:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770275102] [2025-03-17 05:22:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:22:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:05,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:22:05,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:05,300 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-17 05:22:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:05,943 INFO L93 Difference]: Finished difference Result 404 states and 586 transitions. [2025-03-17 05:22:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:05,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 133 [2025-03-17 05:22:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:05,947 INFO L225 Difference]: With dead ends: 404 [2025-03-17 05:22:05,947 INFO L226 Difference]: Without dead ends: 292 [2025-03-17 05:22:05,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:05,949 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 249 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:05,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1255 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-17 05:22:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2025-03-17 05:22:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 177 states have internal predecessors, (246), 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-17 05:22:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 302 transitions. [2025-03-17 05:22:05,975 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 302 transitions. Word has length 133 [2025-03-17 05:22:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:05,976 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 302 transitions. [2025-03-17 05:22:05,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-17 05:22:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 302 transitions. [2025-03-17 05:22:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:05,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:05,979 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] [2025-03-17 05:22:05,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:22:05,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:05,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1072126115, now seen corresponding path program 1 times [2025-03-17 05:22:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130608695] [2025-03-17 05:22:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:05,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:06,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:06,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:06,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:06,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:06,555 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-17 05:22:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130608695] [2025-03-17 05:22:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130608695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609308460] [2025-03-17 05:22:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:06,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:06,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:06,559 INFO L87 Difference]: Start difference. First operand 207 states and 302 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-17 05:22:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:06,668 INFO L93 Difference]: Finished difference Result 416 states and 605 transitions. [2025-03-17 05:22:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:06,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 134 [2025-03-17 05:22:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:06,673 INFO L225 Difference]: With dead ends: 416 [2025-03-17 05:22:06,673 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 05:22:06,675 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-17 05:22:06,676 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 72 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:06,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 937 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 05:22:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2025-03-17 05:22:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 177 states have internal predecessors, (245), 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-17 05:22:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 301 transitions. [2025-03-17 05:22:06,690 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 301 transitions. Word has length 134 [2025-03-17 05:22:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:06,690 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 301 transitions. [2025-03-17 05:22:06,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-17 05:22:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 301 transitions. [2025-03-17 05:22:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:06,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:06,693 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] [2025-03-17 05:22:06,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:22:06,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:06,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1270554871, now seen corresponding path program 1 times [2025-03-17 05:22:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669970362] [2025-03-17 05:22:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:06,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:06,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:06,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:06,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:07,627 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-17 05:22:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:07,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669970362] [2025-03-17 05:22:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669970362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:07,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403529788] [2025-03-17 05:22:07,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:07,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:07,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:07,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:07,630 INFO L87 Difference]: Start difference. First operand 207 states and 301 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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-17 05:22:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:08,123 INFO L93 Difference]: Finished difference Result 718 states and 1036 transitions. [2025-03-17 05:22:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:08,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 134 [2025-03-17 05:22:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:08,130 INFO L225 Difference]: With dead ends: 718 [2025-03-17 05:22:08,130 INFO L226 Difference]: Without dead ends: 512 [2025-03-17 05:22:08,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:22:08,132 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 377 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:08,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1021 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-17 05:22:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 362. [2025-03-17 05:22:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 319 states have (on average 1.401253918495298) internal successors, (447), 322 states have internal predecessors, (447), 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-17 05:22:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 523 transitions. [2025-03-17 05:22:08,154 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 523 transitions. Word has length 134 [2025-03-17 05:22:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:08,154 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 523 transitions. [2025-03-17 05:22:08,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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-17 05:22:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 523 transitions. [2025-03-17 05:22:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:08,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:08,157 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] [2025-03-17 05:22:08,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:22:08,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:08,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1563957878, now seen corresponding path program 1 times [2025-03-17 05:22:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843647283] [2025-03-17 05:22:08,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:08,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:08,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:08,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:08,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:09,520 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-17 05:22:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843647283] [2025-03-17 05:22:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843647283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:09,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:22:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328699241] [2025-03-17 05:22:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:09,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:22:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:09,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:22:09,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:09,522 INFO L87 Difference]: Start difference. First operand 362 states and 523 transitions. Second operand has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:22:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:10,405 INFO L93 Difference]: Finished difference Result 908 states and 1302 transitions. [2025-03-17 05:22:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:10,406 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-17 05:22:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:10,410 INFO L225 Difference]: With dead ends: 908 [2025-03-17 05:22:10,410 INFO L226 Difference]: Without dead ends: 547 [2025-03-17 05:22:10,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:22:10,412 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 438 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:10,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 2065 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:22:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-17 05:22:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 455. [2025-03-17 05:22:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 399 states have (on average 1.3909774436090225) internal successors, (555), 403 states have internal predecessors, (555), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:22:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 653 transitions. [2025-03-17 05:22:10,442 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 653 transitions. Word has length 134 [2025-03-17 05:22:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:10,442 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 653 transitions. [2025-03-17 05:22:10,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:22:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 653 transitions. [2025-03-17 05:22:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:10,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:10,444 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-17 05:22:10,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:22:10,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:10,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash -324355951, now seen corresponding path program 1 times [2025-03-17 05:22:10,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:10,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405197881] [2025-03-17 05:22:10,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:10,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:10,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:10,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:10,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:10,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:10,586 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-17 05:22:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405197881] [2025-03-17 05:22:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405197881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238069696] [2025-03-17 05:22:10,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:10,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:10,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:10,589 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-17 05:22:10,591 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-17 05:22:10,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:10,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:10,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:10,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:10,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:10,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:10,829 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-17 05:22:10,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238069696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:10,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:22:10,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839532700] [2025-03-17 05:22:10,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:10,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:10,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:10,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:10,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:10,831 INFO L87 Difference]: Start difference. First operand 455 states and 653 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-17 05:22:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:10,880 INFO L93 Difference]: Finished difference Result 924 states and 1325 transitions. [2025-03-17 05:22:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:10,880 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-17 05:22:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:10,884 INFO L225 Difference]: With dead ends: 924 [2025-03-17 05:22:10,884 INFO L226 Difference]: Without dead ends: 470 [2025-03-17 05:22:10,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 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-17 05:22:10,885 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 622 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-17 05:22:10,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 622 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-17 05:22:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 464. [2025-03-17 05:22:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 408 states have (on average 1.3823529411764706) internal successors, (564), 412 states have internal predecessors, (564), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:22:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 662 transitions. [2025-03-17 05:22:10,920 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 662 transitions. Word has length 136 [2025-03-17 05:22:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:10,921 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 662 transitions. [2025-03-17 05:22:10,922 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-17 05:22:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 662 transitions. [2025-03-17 05:22:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:10,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:10,925 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-17 05:22:10,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:22:11,125 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-17 05:22:11,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:11,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash 209429473, now seen corresponding path program 1 times [2025-03-17 05:22:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:11,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990195432] [2025-03-17 05:22:11,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:11,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:11,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:11,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:11,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:11,804 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-17 05:22:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990195432] [2025-03-17 05:22:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990195432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:11,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:11,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922639227] [2025-03-17 05:22:11,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:11,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:11,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:11,806 INFO L87 Difference]: Start difference. First operand 464 states and 662 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-17 05:22:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:12,364 INFO L93 Difference]: Finished difference Result 1250 states and 1775 transitions. [2025-03-17 05:22:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:22:12,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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 136 [2025-03-17 05:22:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:12,368 INFO L225 Difference]: With dead ends: 1250 [2025-03-17 05:22:12,368 INFO L226 Difference]: Without dead ends: 787 [2025-03-17 05:22:12,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:22:12,370 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 459 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:12,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1214 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-17 05:22:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 464. [2025-03-17 05:22:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 408 states have (on average 1.375) internal successors, (561), 412 states have internal predecessors, (561), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:22:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 659 transitions. [2025-03-17 05:22:12,407 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 659 transitions. Word has length 136 [2025-03-17 05:22:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:12,408 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 659 transitions. [2025-03-17 05:22:12,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-17 05:22:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 659 transitions. [2025-03-17 05:22:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:12,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:12,409 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-17 05:22:12,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:22:12,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:12,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1518171902, now seen corresponding path program 1 times [2025-03-17 05:22:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:12,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102390154] [2025-03-17 05:22:12,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:12,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:12,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:12,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:12,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:12,729 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-17 05:22:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102390154] [2025-03-17 05:22:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102390154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:12,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:22:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223883144] [2025-03-17 05:22:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:12,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:22:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:12,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:22:12,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:12,732 INFO L87 Difference]: Start difference. First operand 464 states and 659 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-17 05:22:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:12,976 INFO L93 Difference]: Finished difference Result 968 states and 1369 transitions. [2025-03-17 05:22:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:12,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-17 05:22:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:12,980 INFO L225 Difference]: With dead ends: 968 [2025-03-17 05:22:12,980 INFO L226 Difference]: Without dead ends: 505 [2025-03-17 05:22:12,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:12,981 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 116 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:12,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1037 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-17 05:22:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 331. [2025-03-17 05:22:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 286 states have (on average 1.3566433566433567) internal successors, (388), 288 states have internal predecessors, (388), 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-17 05:22:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 466 transitions. [2025-03-17 05:22:13,018 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 466 transitions. Word has length 136 [2025-03-17 05:22:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 466 transitions. [2025-03-17 05:22:13,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-17 05:22:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 466 transitions. [2025-03-17 05:22:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:22:13,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:13,022 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-17 05:22:13,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:22:13,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:13,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash 885411463, now seen corresponding path program 1 times [2025-03-17 05:22:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:13,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181634347] [2025-03-17 05:22:13,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:13,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:13,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:22:13,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:22:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:13,520 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-17 05:22:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181634347] [2025-03-17 05:22:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181634347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:13,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:13,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:13,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99002498] [2025-03-17 05:22:13,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:13,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:13,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:13,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:13,522 INFO L87 Difference]: Start difference. First operand 331 states and 466 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 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-17 05:22:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:14,005 INFO L93 Difference]: Finished difference Result 1039 states and 1451 transitions. [2025-03-17 05:22:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:22:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 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-17 05:22:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:14,009 INFO L225 Difference]: With dead ends: 1039 [2025-03-17 05:22:14,009 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 05:22:14,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:22:14,011 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 240 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:14,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1786 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 05:22:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 523. [2025-03-17 05:22:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 450 states have (on average 1.3444444444444446) internal successors, (605), 454 states have internal predecessors, (605), 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-17 05:22:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 731 transitions. [2025-03-17 05:22:14,039 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 731 transitions. Word has length 138 [2025-03-17 05:22:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:14,039 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 731 transitions. [2025-03-17 05:22:14,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 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-17 05:22:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 731 transitions. [2025-03-17 05:22:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:22:14,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:14,042 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-17 05:22:14,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:22:14,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:14,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:14,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1482133656, now seen corresponding path program 1 times [2025-03-17 05:22:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:14,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476902766] [2025-03-17 05:22:14,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:14,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:22:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:22:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:14,228 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-17 05:22:14,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:14,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476902766] [2025-03-17 05:22:14,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476902766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:14,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:14,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:14,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203971042] [2025-03-17 05:22:14,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:14,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:14,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:14,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:14,230 INFO L87 Difference]: Start difference. First operand 523 states and 731 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-17 05:22:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:14,443 INFO L93 Difference]: Finished difference Result 1076 states and 1501 transitions. [2025-03-17 05:22:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:14,443 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-17 05:22:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:14,447 INFO L225 Difference]: With dead ends: 1076 [2025-03-17 05:22:14,448 INFO L226 Difference]: Without dead ends: 554 [2025-03-17 05:22:14,449 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-17 05:22:14,450 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 89 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:14,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 490 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-17 05:22:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 459. [2025-03-17 05:22:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 398 states have (on average 1.3417085427135678) internal successors, (534), 401 states have internal predecessors, (534), 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-17 05:22:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 638 transitions. [2025-03-17 05:22:14,481 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 638 transitions. Word has length 138 [2025-03-17 05:22:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:14,481 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 638 transitions. [2025-03-17 05:22:14,481 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-17 05:22:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 638 transitions. [2025-03-17 05:22:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:22:14,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:14,482 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-17 05:22:14,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:22:14,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1028778333, now seen corresponding path program 1 times [2025-03-17 05:22:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:14,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472644759] [2025-03-17 05:22:14,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:14,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:14,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:14,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:14,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:14,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:14,713 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-17 05:22:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:14,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472644759] [2025-03-17 05:22:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472644759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:14,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:14,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80212916] [2025-03-17 05:22:14,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:14,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:14,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:14,715 INFO L87 Difference]: Start difference. First operand 459 states and 638 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-17 05:22:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:14,782 INFO L93 Difference]: Finished difference Result 921 states and 1276 transitions. [2025-03-17 05:22:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:14,783 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-17 05:22:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:14,786 INFO L225 Difference]: With dead ends: 921 [2025-03-17 05:22:14,787 INFO L226 Difference]: Without dead ends: 463 [2025-03-17 05:22:14,788 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-17 05:22:14,788 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 66 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:14,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 831 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-17 05:22:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 424. [2025-03-17 05:22:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 363 states have (on average 1.3333333333333333) internal successors, (484), 366 states have internal predecessors, (484), 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-17 05:22:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 588 transitions. [2025-03-17 05:22:14,816 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 588 transitions. Word has length 139 [2025-03-17 05:22:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 588 transitions. [2025-03-17 05:22:14,817 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-17 05:22:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 588 transitions. [2025-03-17 05:22:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:14,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:14,819 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] [2025-03-17 05:22:14,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:22:14,819 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:14,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1152511048, now seen corresponding path program 1 times [2025-03-17 05:22:14,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:14,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075008797] [2025-03-17 05:22:14,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:14,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:14,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:14,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:14,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:14,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:22:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075008797] [2025-03-17 05:22:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075008797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123308708] [2025-03-17 05:22:15,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:15,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:15,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:15,332 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-17 05:22:15,335 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-17 05:22:15,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:15,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:15,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:15,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:15,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 05:22:15,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:15,729 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 28 treesize of output 12 [2025-03-17 05:22:15,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:22:15,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:22:15,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:22:15,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:22:16,061 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 21 treesize of output 13 [2025-03-17 05:22:16,118 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-17 05:22:16,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123308708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:16,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:22:16,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-03-17 05:22:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669818666] [2025-03-17 05:22:16,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:16,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:22:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:16,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:22:16,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:22:16,555 INFO L87 Difference]: Start difference. First operand 424 states and 588 transitions. Second operand has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 05:22:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:18,027 INFO L93 Difference]: Finished difference Result 1210 states and 1663 transitions. [2025-03-17 05:22:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 05:22:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) Word has length 140 [2025-03-17 05:22:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:18,032 INFO L225 Difference]: With dead ends: 1210 [2025-03-17 05:22:18,032 INFO L226 Difference]: Without dead ends: 787 [2025-03-17 05:22:18,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 05:22:18,034 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 314 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:18,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 2014 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:22:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-17 05:22:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 746. [2025-03-17 05:22:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 635 states have (on average 1.3275590551181102) internal successors, (843), 640 states have internal predecessors, (843), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 88 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 05:22:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1029 transitions. [2025-03-17 05:22:18,070 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1029 transitions. Word has length 140 [2025-03-17 05:22:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:18,070 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1029 transitions. [2025-03-17 05:22:18,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 05:22:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1029 transitions. [2025-03-17 05:22:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:18,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:18,072 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] [2025-03-17 05:22:18,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:22:18,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:18,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:18,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:18,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1996982919, now seen corresponding path program 1 times [2025-03-17 05:22:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:18,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230297118] [2025-03-17 05:22:18,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:18,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:18,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:20,511 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-17 05:22:20,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:20,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230297118] [2025-03-17 05:22:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230297118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:20,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:22:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947533569] [2025-03-17 05:22:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:20,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:22:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:20,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:22:20,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:20,512 INFO L87 Difference]: Start difference. First operand 746 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-17 05:22:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:21,480 INFO L93 Difference]: Finished difference Result 2281 states and 3139 transitions. [2025-03-17 05:22:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:21,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 140 [2025-03-17 05:22:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:21,488 INFO L225 Difference]: With dead ends: 2281 [2025-03-17 05:22:21,488 INFO L226 Difference]: Without dead ends: 1536 [2025-03-17 05:22:21,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:22:21,492 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 466 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:21,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1197 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:22:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-17 05:22:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1065. [2025-03-17 05:22:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 915 states have (on average 1.3344262295081968) internal successors, (1221), 920 states have internal predecessors, (1221), 127 states have call successors, (127), 22 states have call predecessors, (127), 22 states have return successors, (127), 122 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-17 05:22:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1475 transitions. [2025-03-17 05:22:21,567 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1475 transitions. Word has length 140 [2025-03-17 05:22:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:21,567 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1475 transitions. [2025-03-17 05:22:21,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-17 05:22:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1475 transitions. [2025-03-17 05:22:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:21,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:21,571 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] [2025-03-17 05:22:21,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:22:21,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:21,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1383121883, now seen corresponding path program 1 times [2025-03-17 05:22:21,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:21,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339146370] [2025-03-17 05:22:21,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:21,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:21,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:21,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:21,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:21,845 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-17 05:22:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339146370] [2025-03-17 05:22:21,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339146370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:21,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:21,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:21,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775111886] [2025-03-17 05:22:21,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:21,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:21,847 INFO L87 Difference]: Start difference. First operand 1065 states and 1475 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-17 05:22:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:21,934 INFO L93 Difference]: Finished difference Result 1501 states and 2075 transitions. [2025-03-17 05:22:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 140 [2025-03-17 05:22:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:21,939 INFO L225 Difference]: With dead ends: 1501 [2025-03-17 05:22:21,939 INFO L226 Difference]: Without dead ends: 1078 [2025-03-17 05:22:21,941 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-17 05:22:21,941 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 45 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:21,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 761 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-03-17 05:22:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1054. [2025-03-17 05:22:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 904 states have (on average 1.3307522123893805) internal successors, (1203), 909 states have internal predecessors, (1203), 127 states have call successors, (127), 22 states have call predecessors, (127), 22 states have return successors, (127), 122 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-17 05:22:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1457 transitions. [2025-03-17 05:22:21,993 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1457 transitions. Word has length 140 [2025-03-17 05:22:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:21,993 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1457 transitions. [2025-03-17 05:22:21,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-17 05:22:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1457 transitions. [2025-03-17 05:22:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:21,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:21,996 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] [2025-03-17 05:22:21,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:22:21,996 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:21,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1242564165, now seen corresponding path program 1 times [2025-03-17 05:22:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836700396] [2025-03-17 05:22:21,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:21,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:22,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:22,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:22,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:22,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:22,189 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-17 05:22:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836700396] [2025-03-17 05:22:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836700396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395694410] [2025-03-17 05:22:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:22,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:22,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:22,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:22,191 INFO L87 Difference]: Start difference. First operand 1054 states and 1457 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-17 05:22:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:22,294 INFO L93 Difference]: Finished difference Result 1482 states and 2045 transitions. [2025-03-17 05:22:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 140 [2025-03-17 05:22:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:22,300 INFO L225 Difference]: With dead ends: 1482 [2025-03-17 05:22:22,300 INFO L226 Difference]: Without dead ends: 1070 [2025-03-17 05:22:22,301 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-17 05:22:22,302 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 72 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:22,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 612 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-17 05:22:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1046. [2025-03-17 05:22:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 896 states have (on average 1.3303571428571428) internal successors, (1192), 901 states have internal predecessors, (1192), 127 states have call successors, (127), 22 states have call predecessors, (127), 22 states have return successors, (127), 122 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-17 05:22:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1446 transitions. [2025-03-17 05:22:22,357 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1446 transitions. Word has length 140 [2025-03-17 05:22:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:22,363 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1446 transitions. [2025-03-17 05:22:22,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-17 05:22:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1446 transitions. [2025-03-17 05:22:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:22:22,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:22,364 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] [2025-03-17 05:22:22,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:22:22,364 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:22,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 738711253, now seen corresponding path program 1 times [2025-03-17 05:22:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:22,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914883726] [2025-03-17 05:22:22,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:22,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:22,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:22,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:22,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:22,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:22:22,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624373853] [2025-03-17 05:22:22,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:22,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:22,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:22,426 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-17 05:22:22,427 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-17 05:22:22,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:22,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:22,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:22,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:22:22,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:22:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:22:22,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:22:22,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:22,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:22:23,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:22:23,001 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:22:23,001 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:22:23,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:22:23,209 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,SelfDestructingSolverStorable16 [2025-03-17 05:22:23,211 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:22:23,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:22:23,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:22:23 BoogieIcfgContainer [2025-03-17 05:22:23,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:22:23,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:22:23,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:22:23,298 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:22:23,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:02" (3/4) ... [2025-03-17 05:22:23,301 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:22:23,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:22:23,302 INFO L158 Benchmark]: Toolchain (without parser) took 21593.07ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 105.6MB in the beginning and 409.9MB in the end (delta: -304.3MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2025-03-17 05:22:23,302 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:22:23,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.67ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 89.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:22:23,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.77ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.8MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:22:23,302 INFO L158 Benchmark]: Boogie Preprocessor took 77.22ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 80.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:22:23,303 INFO L158 Benchmark]: IcfgBuilder took 708.68ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 42.4MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:22:23,303 INFO L158 Benchmark]: TraceAbstraction took 20412.19ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 41.4MB in the beginning and 410.1MB in the end (delta: -368.7MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2025-03-17 05:22:23,303 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 587.2MB. Free memory was 410.1MB in the beginning and 409.9MB in the end (delta: 189.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:22:23,304 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.67ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 89.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.77ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.8MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.22ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 80.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 708.68ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 42.4MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20412.19ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 41.4MB in the beginning and 410.1MB in the end (delta: -368.7MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 587.2MB. Free memory was 410.1MB in the beginning and 409.9MB in the end (delta: 189.3kB). 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 105, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 82, 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; [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=3, stepLocal_4=3, 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=3, 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, 113 locations, 184 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 17, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3023 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3004 mSDsluCounter, 16468 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13260 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5423 IncrementalHoareTripleChecker+Invalid, 5624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 3208 mSDtfsCounter, 5423 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1065occurred in iteration=14, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1714 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 2873 NumberOfCodeBlocks, 2873 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2574 ConstructedInterpolants, 0 QuantifiedInterpolants, 8929 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1402 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 10202/10336 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-17 05:22:23,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-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-?-8fc3dc6-m [2025-03-17 05:22:25,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:22:25,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:22:25,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:22:25,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:22:25,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:22:25,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:22:25,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:22:25,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:22:25,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:22:25,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:22:25,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:22:25,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:22:25,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:22:25,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:22:25,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:22:25,685 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:22:25,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:25,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:22:25,686 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:22:25,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:22:25,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:22:25,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:22:25,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:22:25,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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-17 05:22:25,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:22:26,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:22:26,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:22:26,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:22:26,012 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:22:26,013 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-17 05:22:27,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35179d478/0057ad4d95084cc2b53fcf71dd0fd0fa/FLAG9f8abe1f4 [2025-03-17 05:22:27,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:22:27,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2025-03-17 05:22:27,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35179d478/0057ad4d95084cc2b53fcf71dd0fd0fa/FLAG9f8abe1f4 [2025-03-17 05:22:27,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35179d478/0057ad4d95084cc2b53fcf71dd0fd0fa [2025-03-17 05:22:27,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:22:27,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:22:27,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:27,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:22:27,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:22:27,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:27,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffb455a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27, skipping insertion in model container [2025-03-17 05:22:27,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:27,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:22:27,748 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-17 05:22:27,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:27,828 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:22:27,838 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-17 05:22:27,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:27,919 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:22:27,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27 WrapperNode [2025-03-17 05:22:27,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:27,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:27,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:22:27,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:22:27,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:27,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:27,994 INFO L138 Inliner]: procedures = 36, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2025-03-17 05:22:27,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:27,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:22:27,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:22:27,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:22:28,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,059 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-17 05:22:28,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:22:28,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:22:28,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:22:28,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:22:28,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (1/1) ... [2025-03-17 05:22:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:28,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:28,163 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-17 05:22:28,168 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-17 05:22:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:22:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:22:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:22:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:22:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:22:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:22:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:22:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:22:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:22:28,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:22:28,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:22:28,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:22:28,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:22:28,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:22:28,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:22:28,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:22:28,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:22:28,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:22:28,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:22:28,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:22:28,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:22:28,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:22:28,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:22:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:22:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:22:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:22:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:22:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:22:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:22:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:22:28,369 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:22:28,371 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:22:29,493 INFO L1322 $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-17 05:22:29,522 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-03-17 05:22:29,523 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:22:29,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:22:29,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:22:29,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:29 BoogieIcfgContainer [2025-03-17 05:22:29,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:22:29,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:22:29,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:22:29,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:22:29,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:22:27" (1/3) ... [2025-03-17 05:22:29,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169fea97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:29, skipping insertion in model container [2025-03-17 05:22:29,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:27" (2/3) ... [2025-03-17 05:22:29,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169fea97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:29, skipping insertion in model container [2025-03-17 05:22:29,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:29" (3/3) ... [2025-03-17 05:22:29,542 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-30.i [2025-03-17 05:22:29,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:22:29,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-30.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:22:29,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:22:29,608 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;@2e3df65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:22:29,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:22:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 89 states have internal predecessors, (126), 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-17 05:22:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:22:29,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:29,621 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] [2025-03-17 05:22:29,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:29,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1912814249, now seen corresponding path program 1 times [2025-03-17 05:22:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:29,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954654124] [2025-03-17 05:22:29,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:29,635 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-17 05:22:29,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:29,640 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-17 05:22:29,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 (2)] Waiting until timeout for monitored process [2025-03-17 05:22:29,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:22:30,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:22:30,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:30,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:30,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:22:30,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:30,055 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-17 05:22:30,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:30,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954654124] [2025-03-17 05:22:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954654124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:22:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574124994] [2025-03-17 05:22:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:30,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:22:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:30,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:22:30,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:22:30,078 INFO L87 Difference]: Start difference. First operand has 108 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 89 states have internal predecessors, (126), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 05:22:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:30,098 INFO L93 Difference]: Finished difference Result 213 states and 335 transitions. [2025-03-17 05:22:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:22:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 131 [2025-03-17 05:22:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:30,106 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:22:30,106 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:22:30,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:22:30,111 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:30,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:22:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 05:22:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:22:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2025-03-17 05:22:30,143 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 131 [2025-03-17 05:22:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:30,143 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2025-03-17 05:22:30,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 05:22:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2025-03-17 05:22:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:22:30,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:30,149 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] [2025-03-17 05:22:30,160 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-17 05:22:30,350 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-17 05:22:30,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:30,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1627042402, now seen corresponding path program 1 times [2025-03-17 05:22:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:30,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152679961] [2025-03-17 05:22:30,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:30,352 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-17 05:22:30,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:30,356 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-17 05:22:30,358 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-17 05:22:30,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:22:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:22:30,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:30,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:30,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:30,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:30,905 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-17 05:22:30,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:30,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152679961] [2025-03-17 05:22:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152679961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:30,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170911463] [2025-03-17 05:22:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:30,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:30,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:30,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:30,909 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-17 05:22:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:30,985 INFO L93 Difference]: Finished difference Result 216 states and 318 transitions. [2025-03-17 05:22:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 131 [2025-03-17 05:22:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:30,988 INFO L225 Difference]: With dead ends: 216 [2025-03-17 05:22:30,988 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 05:22:30,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 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-17 05:22:30,989 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 591 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-17 05:22:30,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 591 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 05:22:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-17 05:22:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 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-17 05:22:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-17 05:22:31,007 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 131 [2025-03-17 05:22:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:31,008 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-17 05:22:31,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-17 05:22:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-17 05:22:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:22:31,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:31,009 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] [2025-03-17 05:22:31,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:22:31,210 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-17 05:22:31,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1626118881, now seen corresponding path program 1 times [2025-03-17 05:22:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043615078] [2025-03-17 05:22:31,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:31,212 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-17 05:22:31,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:31,215 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-17 05:22:31,217 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-17 05:22:31,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:22:31,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:22:31,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:31,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:31,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:22:31,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:31,762 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-17 05:22:31,796 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-17 05:22:31,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:31,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043615078] [2025-03-17 05:22:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043615078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:31,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:31,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485642861] [2025-03-17 05:22:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:31,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:31,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:31,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:31,798 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-17 05:22:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:32,716 INFO L93 Difference]: Finished difference Result 220 states and 320 transitions. [2025-03-17 05:22:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:32,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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 131 [2025-03-17 05:22:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:32,719 INFO L225 Difference]: With dead ends: 220 [2025-03-17 05:22:32,720 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 05:22:32,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 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-17 05:22:32,722 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 132 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 485 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.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:32,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 485 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:22:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 05:22:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-17 05:22:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 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-17 05:22:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-03-17 05:22:32,730 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 131 [2025-03-17 05:22:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:32,731 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-03-17 05:22:32,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-17 05:22:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-03-17 05:22:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:22:32,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:32,733 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] [2025-03-17 05:22:32,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:22:32,937 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-17 05:22:32,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:32,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 611472796, now seen corresponding path program 1 times [2025-03-17 05:22:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:32,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563105551] [2025-03-17 05:22:32,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:32,939 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-17 05:22:32,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:32,945 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-17 05:22:32,946 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-17 05:22:33,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:33,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:33,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:33,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:22:33,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-17 05:22:33,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:33,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563105551] [2025-03-17 05:22:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563105551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:33,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891940921] [2025-03-17 05:22:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:33,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:33,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:33,410 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:22:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:33,665 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2025-03-17 05:22:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:33,672 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), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 133 [2025-03-17 05:22:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:33,673 INFO L225 Difference]: With dead ends: 223 [2025-03-17 05:22:33,673 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:22:33,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 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-17 05:22:33,674 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:33,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 629 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:22:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-17 05:22:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 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-17 05:22:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-03-17 05:22:33,684 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 133 [2025-03-17 05:22:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:33,684 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-03-17 05:22:33,684 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), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:22:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-03-17 05:22:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:22:33,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:33,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] [2025-03-17 05:22:33,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:22:33,888 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-17 05:22:33,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:33,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1564674429, now seen corresponding path program 1 times [2025-03-17 05:22:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164700785] [2025-03-17 05:22:33,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:33,890 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-17 05:22:33,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:33,894 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-17 05:22:33,895 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-17 05:22:33,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:34,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:34,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:34,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:22:34,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:34,465 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-17 05:22:34,476 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-17 05:22:34,500 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-17 05:22:34,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:34,536 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-17 05:22:34,544 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-17 05:22:34,586 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-17 05:22:34,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:34,586 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:34,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164700785] [2025-03-17 05:22:34,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164700785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:34,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:34,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:34,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614032323] [2025-03-17 05:22:34,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:34,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:34,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:34,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:34,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:34,588 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-17 05:22:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:35,179 INFO L93 Difference]: Finished difference Result 392 states and 558 transitions. [2025-03-17 05:22:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:35,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 133 [2025-03-17 05:22:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:35,182 INFO L225 Difference]: With dead ends: 392 [2025-03-17 05:22:35,182 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 05:22:35,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 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-17 05:22:35,183 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 229 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:35,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 955 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 05:22:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2025-03-17 05:22:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3652694610778444) internal successors, (228), 168 states have internal predecessors, (228), 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-17 05:22:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 284 transitions. [2025-03-17 05:22:35,199 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 284 transitions. Word has length 133 [2025-03-17 05:22:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:35,199 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 284 transitions. [2025-03-17 05:22:35,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-17 05:22:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 284 transitions. [2025-03-17 05:22:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:35,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:35,201 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] [2025-03-17 05:22:35,215 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-17 05:22:35,401 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-17 05:22:35,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:35,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash 744161565, now seen corresponding path program 1 times [2025-03-17 05:22:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812878208] [2025-03-17 05:22:35,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:35,403 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-17 05:22:35,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:35,405 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-17 05:22:35,406 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-17 05:22:35,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:35,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:35,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:35,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:35,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:22:35,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:36,029 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-17 05:22:36,052 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-17 05:22:36,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:36,183 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-17 05:22:36,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812878208] [2025-03-17 05:22:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812878208] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:36,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-17 05:22:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120570425] [2025-03-17 05:22:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:36,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:36,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:36,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:36,185 INFO L87 Difference]: Start difference. First operand 198 states and 284 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-17 05:22:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:36,287 INFO L93 Difference]: Finished difference Result 398 states and 569 transitions. [2025-03-17 05:22:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:36,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 134 [2025-03-17 05:22:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:36,289 INFO L225 Difference]: With dead ends: 398 [2025-03-17 05:22:36,289 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 05:22:36,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 256 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-17 05:22:36,292 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 67 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 649 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-17 05:22:36,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 649 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 05:22:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-03-17 05:22:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 168 states have internal predecessors, (227), 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-17 05:22:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 283 transitions. [2025-03-17 05:22:36,316 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 283 transitions. Word has length 134 [2025-03-17 05:22:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:36,317 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 283 transitions. [2025-03-17 05:22:36,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-17 05:22:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 283 transitions. [2025-03-17 05:22:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:36,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:36,318 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] [2025-03-17 05:22:36,336 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-17 05:22:36,519 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-17 05:22:36,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:36,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 591999945, now seen corresponding path program 1 times [2025-03-17 05:22:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:36,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521279189] [2025-03-17 05:22:36,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:36,520 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-17 05:22:36,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:36,522 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-17 05:22:36,523 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-17 05:22:36,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:36,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:36,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:36,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:37,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:22:37,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:37,014 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-17 05:22:37,069 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 30 treesize of output 14 [2025-03-17 05:22:37,204 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-17 05:22:37,251 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-17 05:22:37,393 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-17 05:22:37,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:37,485 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 33 [2025-03-17 05:22:37,552 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-17 05:22:39,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:39,060 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 119 treesize of output 61 [2025-03-17 05:22:39,249 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-17 05:22:39,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:43,006 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-17 05:22:43,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:43,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521279189] [2025-03-17 05:22:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521279189] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:43,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 23 [2025-03-17 05:22:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798140166] [2025-03-17 05:22:43,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:43,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:22:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:43,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:22:43,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:22:43,009 INFO L87 Difference]: Start difference. First operand 198 states and 283 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-17 05:22:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:50,533 INFO L93 Difference]: Finished difference Result 580 states and 819 transitions. [2025-03-17 05:22:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 134 [2025-03-17 05:22:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:50,542 INFO L225 Difference]: With dead ends: 580 [2025-03-17 05:22:50,542 INFO L226 Difference]: Without dead ends: 383 [2025-03-17 05:22:50,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:22:50,543 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 470 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:50,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1259 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-17 05:22:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-17 05:22:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 272. [2025-03-17 05:22:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 237 states have internal predecessors, (319), 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-17 05:22:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 385 transitions. [2025-03-17 05:22:50,577 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 385 transitions. Word has length 134 [2025-03-17 05:22:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:50,579 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 385 transitions. [2025-03-17 05:22:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-17 05:22:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 385 transitions. [2025-03-17 05:22:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:50,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:50,581 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-17 05:22:50,600 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-17 05:22:50,783 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-17 05:22:50,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:50,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash -559939119, now seen corresponding path program 1 times [2025-03-17 05:22:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:50,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080339544] [2025-03-17 05:22:50,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:50,784 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-17 05:22:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:50,788 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-17 05:22:50,789 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-17 05:22:50,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:51,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:51,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:51,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:51,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:51,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:51,189 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-17 05:22:51,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:51,190 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080339544] [2025-03-17 05:22:51,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080339544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:51,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548687182] [2025-03-17 05:22:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:51,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:51,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:51,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:51,194 INFO L87 Difference]: Start difference. First operand 272 states and 385 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-17 05:22:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:51,272 INFO L93 Difference]: Finished difference Result 552 states and 781 transitions. [2025-03-17 05:22:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:51,272 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-17 05:22:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:51,274 INFO L225 Difference]: With dead ends: 552 [2025-03-17 05:22:51,274 INFO L226 Difference]: Without dead ends: 281 [2025-03-17 05:22:51,275 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-17 05:22:51,278 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:51,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-17 05:22:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2025-03-17 05:22:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 242 states have (on average 1.3471074380165289) internal successors, (326), 244 states have internal predecessors, (326), 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-17 05:22:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 392 transitions. [2025-03-17 05:22:51,292 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 392 transitions. Word has length 136 [2025-03-17 05:22:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:51,293 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 392 transitions. [2025-03-17 05:22:51,293 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-17 05:22:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 392 transitions. [2025-03-17 05:22:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:51,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:51,295 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-17 05:22:51,309 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-17 05:22:51,495 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-17 05:22:51,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:51,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash -20660768, now seen corresponding path program 1 times [2025-03-17 05:22:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:51,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077502314] [2025-03-17 05:22:51,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:51,496 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-17 05:22:51,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:51,500 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-17 05:22:51,501 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-17 05:22:51,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:51,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:51,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:51,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:51,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:22:51,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:51,947 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-17 05:22:52,139 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-17 05:22:53,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:53,866 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-17 05:22:53,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:53,888 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-17 05:22:54,635 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-17 05:22:54,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:54,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077502314] [2025-03-17 05:22:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077502314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:54,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:54,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153166293] [2025-03-17 05:22:54,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:54,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:54,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:54,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:54,637 INFO L87 Difference]: Start difference. First operand 279 states and 392 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 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-17 05:23:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:04,947 INFO L93 Difference]: Finished difference Result 1025 states and 1422 transitions. [2025-03-17 05:23:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:23:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 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-17 05:23:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:04,960 INFO L225 Difference]: With dead ends: 1025 [2025-03-17 05:23:04,960 INFO L226 Difference]: Without dead ends: 747 [2025-03-17 05:23:04,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:23:04,962 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 294 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:04,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1468 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-03-17 05:23:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-17 05:23:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 392. [2025-03-17 05:23:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 349 states have (on average 1.3553008595988538) internal successors, (473), 352 states have internal predecessors, (473), 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-17 05:23:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 549 transitions. [2025-03-17 05:23:04,995 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 549 transitions. Word has length 136 [2025-03-17 05:23:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:04,996 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 549 transitions. [2025-03-17 05:23:04,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 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-17 05:23:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 549 transitions. [2025-03-17 05:23:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:23:04,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:04,997 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-17 05:23:05,015 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-17 05:23:05,198 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-17 05:23:05,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:05,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1486891041, now seen corresponding path program 1 times [2025-03-17 05:23:05,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:05,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446342421] [2025-03-17 05:23:05,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:05,199 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-17 05:23:05,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:05,202 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-17 05:23:05,203 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-17 05:23:05,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:23:05,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:23:05,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:05,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:05,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:23:05,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:05,605 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-17 05:23:05,655 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-17 05:23:05,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:05,792 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-17 05:23:05,796 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-17 05:23:05,870 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-17 05:23:05,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:05,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:05,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446342421] [2025-03-17 05:23:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446342421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:23:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512139082] [2025-03-17 05:23:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:05,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:23:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:05,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:23:05,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:23:05,871 INFO L87 Difference]: Start difference. First operand 392 states and 549 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-17 05:23:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:07,901 INFO L93 Difference]: Finished difference Result 1100 states and 1526 transitions. [2025-03-17 05:23:07,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:23:07,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-17 05:23:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:07,909 INFO L225 Difference]: With dead ends: 1100 [2025-03-17 05:23:07,909 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 05:23:07,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:07,912 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 322 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1375 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.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:07,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1375 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 05:23:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 05:23:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 392. [2025-03-17 05:23:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 349 states have (on average 1.3553008595988538) internal successors, (473), 352 states have internal predecessors, (473), 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-17 05:23:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 549 transitions. [2025-03-17 05:23:07,939 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 549 transitions. Word has length 136 [2025-03-17 05:23:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:07,940 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 549 transitions. [2025-03-17 05:23:07,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-17 05:23:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 549 transitions. [2025-03-17 05:23:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:23:07,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:07,941 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-17 05:23:07,954 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-17 05:23:08,145 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-17 05:23:08,145 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:08,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 976466853, now seen corresponding path program 1 times [2025-03-17 05:23:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768644188] [2025-03-17 05:23:08,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:08,146 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-17 05:23:08,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:08,148 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-17 05:23:08,149 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-17 05:23:08,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:23:08,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:23:08,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:08,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:08,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:23:08,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:08,569 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-17 05:23:08,658 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-17 05:23:08,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:08,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768644188] [2025-03-17 05:23:08,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768644188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:08,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:08,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:23:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53530354] [2025-03-17 05:23:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:08,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:08,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:08,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:08,659 INFO L87 Difference]: Start difference. First operand 392 states and 549 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-17 05:23:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:09,076 INFO L93 Difference]: Finished difference Result 824 states and 1149 transitions. [2025-03-17 05:23:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:09,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-17 05:23:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:09,079 INFO L225 Difference]: With dead ends: 824 [2025-03-17 05:23:09,079 INFO L226 Difference]: Without dead ends: 433 [2025-03-17 05:23:09,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:23:09,080 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 109 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 928 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.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:09,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 928 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:23:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-17 05:23:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 349. [2025-03-17 05:23:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 304 states have (on average 1.3388157894736843) internal successors, (407), 306 states have internal predecessors, (407), 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-17 05:23:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 485 transitions. [2025-03-17 05:23:09,098 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 485 transitions. Word has length 136 [2025-03-17 05:23:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:09,099 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 485 transitions. [2025-03-17 05:23:09,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-17 05:23:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 485 transitions. [2025-03-17 05:23:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:23:09,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:09,100 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] [2025-03-17 05:23:09,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-17 05:23:09,301 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-17 05:23:09,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:09,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1122690090, now seen corresponding path program 1 times [2025-03-17 05:23:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803996545] [2025-03-17 05:23:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:09,302 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-17 05:23:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:09,304 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-17 05:23:09,306 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-17 05:23:09,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:23:09,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:23:09,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:09,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:09,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:23:09,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:09,904 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-17 05:23:09,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:10,002 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-17 05:23:10,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803996545] [2025-03-17 05:23:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803996545] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:10,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:23:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-17 05:23:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595470077] [2025-03-17 05:23:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:10,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:10,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:10,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:23:10,003 INFO L87 Difference]: Start difference. First operand 349 states and 485 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-17 05:23:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:10,150 INFO L93 Difference]: Finished difference Result 773 states and 1069 transitions. [2025-03-17 05:23:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 137 [2025-03-17 05:23:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:10,155 INFO L225 Difference]: With dead ends: 773 [2025-03-17 05:23:10,155 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 05:23:10,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 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-17 05:23:10,156 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 118 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 471 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-17 05:23:10,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 471 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 05:23:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 343. [2025-03-17 05:23:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 298 states have (on average 1.332214765100671) internal successors, (397), 300 states have internal predecessors, (397), 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-17 05:23:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 475 transitions. [2025-03-17 05:23:10,172 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 475 transitions. Word has length 137 [2025-03-17 05:23:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:10,172 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 475 transitions. [2025-03-17 05:23:10,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-17 05:23:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 475 transitions. [2025-03-17 05:23:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:23:10,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:10,174 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] [2025-03-17 05:23:10,186 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-17 05:23:10,374 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-17 05:23:10,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2119707175, now seen corresponding path program 1 times [2025-03-17 05:23:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14596220] [2025-03-17 05:23:10,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:10,376 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-17 05:23:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:10,378 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-17 05:23:10,380 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-17 05:23:10,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:23:10,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:23:10,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:10,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:10,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:23:10,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:10,854 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-17 05:23:10,859 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-17 05:23:10,908 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-17 05:23:10,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:10,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14596220] [2025-03-17 05:23:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14596220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:10,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:10,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422683760] [2025-03-17 05:23:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:10,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:10,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:10,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:10,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:10,909 INFO L87 Difference]: Start difference. First operand 343 states and 475 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-17 05:23:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:11,733 INFO L93 Difference]: Finished difference Result 717 states and 991 transitions. [2025-03-17 05:23:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:11,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 137 [2025-03-17 05:23:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:11,740 INFO L225 Difference]: With dead ends: 717 [2025-03-17 05:23:11,740 INFO L226 Difference]: Without dead ends: 375 [2025-03-17 05:23:11,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 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-17 05:23:11,742 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 91 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 666 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.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:11,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 666 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:23:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-17 05:23:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 308. [2025-03-17 05:23:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 263 states have (on average 1.3193916349809887) internal successors, (347), 265 states have internal predecessors, (347), 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-17 05:23:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2025-03-17 05:23:11,762 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 137 [2025-03-17 05:23:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:11,763 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2025-03-17 05:23:11,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-17 05:23:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2025-03-17 05:23:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:23:11,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:11,764 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-17 05:23:11,788 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-17 05:23:11,965 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-17 05:23:11,965 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:11,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1175667782, now seen corresponding path program 1 times [2025-03-17 05:23:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:11,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765687731] [2025-03-17 05:23:11,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:11,966 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-17 05:23:11,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:11,968 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-17 05:23:11,970 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-17 05:23:12,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:23:12,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:23:12,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:12,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:12,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:23:12,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:12,397 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-17 05:23:12,486 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-17 05:23:12,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:12,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:12,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765687731] [2025-03-17 05:23:12,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765687731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:12,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:12,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:23:12,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760329405] [2025-03-17 05:23:12,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:12,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:12,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:12,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:23:12,488 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (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-17 05:23:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:12,983 INFO L93 Difference]: Finished difference Result 801 states and 1099 transitions. [2025-03-17 05:23:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (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-17 05:23:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:12,986 INFO L225 Difference]: With dead ends: 801 [2025-03-17 05:23:12,986 INFO L226 Difference]: Without dead ends: 494 [2025-03-17 05:23:12,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 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-17 05:23:12,988 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 114 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1274 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.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:12,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1274 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:23:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-17 05:23:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 491. [2025-03-17 05:23:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 418 states have (on average 1.3038277511961722) internal successors, (545), 422 states have internal predecessors, (545), 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-17 05:23:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 671 transitions. [2025-03-17 05:23:13,013 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 671 transitions. Word has length 138 [2025-03-17 05:23:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:13,013 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 671 transitions. [2025-03-17 05:23:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (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-17 05:23:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 671 transitions. [2025-03-17 05:23:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:23:13,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:13,014 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-17 05:23:13,033 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-17 05:23:13,215 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-17 05:23:13,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:13,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1637604555, now seen corresponding path program 1 times [2025-03-17 05:23:13,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:13,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485606439] [2025-03-17 05:23:13,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:13,217 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-17 05:23:13,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:13,219 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-17 05:23:13,220 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-17 05:23:13,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:23:13,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:23:13,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:13,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:13,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:23:13,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:13,727 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-17 05:23:13,732 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-17 05:23:13,801 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-17 05:23:13,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:13,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485606439] [2025-03-17 05:23:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485606439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:13,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955360659] [2025-03-17 05:23:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:13,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:13,802 INFO L87 Difference]: Start difference. First operand 491 states and 671 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-17 05:23:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:14,470 INFO L93 Difference]: Finished difference Result 1010 states and 1376 transitions. [2025-03-17 05:23:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:14,471 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-17 05:23:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:14,473 INFO L225 Difference]: With dead ends: 1010 [2025-03-17 05:23:14,473 INFO L226 Difference]: Without dead ends: 520 [2025-03-17 05:23:14,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 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-17 05:23:14,475 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 82 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 471 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:14,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 471 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:23:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-17 05:23:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 427. [2025-03-17 05:23:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 366 states have (on average 1.3032786885245902) internal successors, (477), 369 states have internal predecessors, (477), 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-17 05:23:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 581 transitions. [2025-03-17 05:23:14,496 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 581 transitions. Word has length 138 [2025-03-17 05:23:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:14,496 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 581 transitions. [2025-03-17 05:23:14,496 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-17 05:23:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 581 transitions. [2025-03-17 05:23:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:23:14,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:14,497 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] [2025-03-17 05:23:14,509 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-17 05:23:14,698 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-17 05:23:14,698 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash 497523704, now seen corresponding path program 1 times [2025-03-17 05:23:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666126652] [2025-03-17 05:23:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:14,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:14,704 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-17 05:23:14,705 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-17 05:23:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:23:15,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:23:15,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:15,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:15,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:23:15,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:19,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:19,519 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-17 05:23:21,104 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-17 05:23:21,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:21,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666126652] [2025-03-17 05:23:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666126652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:23:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500149776] [2025-03-17 05:23:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:21,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:21,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:21,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:23:21,106 INFO L87 Difference]: Start difference. First operand 427 states and 581 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 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)