./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.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 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:25:19,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:25:19,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:25:19,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:25:19,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:25:19,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:25:19,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:25:19,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:25:19,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:25:19,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:25:19,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:25:19,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:25:19,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:25:19,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:25:19,644 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:25:19,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:25:19,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:25:19,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:25:19,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:25:19,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:25:19,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:25:19,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:25:19,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:25:19,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:25:19,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:25:19,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:25:19,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:25:19,646 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 -> 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 [2025-03-04 01:25:19,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:25:19,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:25:19,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:25:19,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:25:19,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:25:19,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-p_file-18.i [2025-03-04 01:25:21,075 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b7bde5/06d8634d82714af9adac2e919cfb3852/FLAGfbbfa08d0 [2025-03-04 01:25:21,294 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:25:21,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2025-03-04 01:25:21,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b7bde5/06d8634d82714af9adac2e919cfb3852/FLAGfbbfa08d0 [2025-03-04 01:25:21,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b7bde5/06d8634d82714af9adac2e919cfb3852 [2025-03-04 01:25:21,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:25:21,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:25:21,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:25:21,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:25:21,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:25:21,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@353fc2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21, skipping insertion in model container [2025-03-04 01:25:21,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:25:21,767 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-p_file-18.i[916,929] [2025-03-04 01:25:21,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:25:21,828 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:25:21,839 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-p_file-18.i[916,929] [2025-03-04 01:25:21,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:25:21,889 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:25:21,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21 WrapperNode [2025-03-04 01:25:21,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:25:21,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:25:21,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:25:21,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:25:21,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,932 INFO L138 Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2025-03-04 01:25:21,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:25:21,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:25:21,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:25:21,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:25:21,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,960 INFO L175 MemorySlicer]: Split 115 memory accesses to 11 slices as follows [2, 5, 14, 8, 12, 12, 26, 12, 8, 10, 6]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1]. [2025-03-04 01:25:21,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:25:21,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:25:21,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:25:21,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:25:21,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (1/1) ... [2025-03-04 01:25:21,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:25:22,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:25:22,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:25:22,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:25:22,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:25:22,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:25:22,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:25:22,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:25:22,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:25:22,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:25:22,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:25:22,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:25:22,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:25:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:25:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:25:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:25:22,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:25:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:25:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:25:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:25:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:25:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:25:22,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:25:22,206 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:25:22,208 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:25:22,669 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem80#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~bitwise81#1;havoc property_#t~mem82#1;havoc property_#t~ite95#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite108#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem104#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~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~bitwise112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~ite122#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; [2025-03-04 01:25:22,714 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-04 01:25:22,715 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:25:22,736 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:25:22,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:25:22,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:25:22 BoogieIcfgContainer [2025-03-04 01:25:22,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:25:22,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:25:22,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:25:22,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:25:22,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:25:21" (1/3) ... [2025-03-04 01:25:22,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad6c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:25:22, skipping insertion in model container [2025-03-04 01:25:22,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:21" (2/3) ... [2025-03-04 01:25:22,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad6c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:25:22, skipping insertion in model container [2025-03-04 01:25:22,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:25:22" (3/3) ... [2025-03-04 01:25:22,747 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-18.i [2025-03-04 01:25:22,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:25:22,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-18.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:25:22,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:25:22,824 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;@14d3e552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:25:22,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:25:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:25:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:25:22,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:22,838 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:22,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:22,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2122816270, now seen corresponding path program 1 times [2025-03-04 01:25:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:22,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424165157] [2025-03-04 01:25:22,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:22,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:25:22,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:25:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:25:23,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424165157] [2025-03-04 01:25:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424165157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:25:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793266127] [2025-03-04 01:25:23,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:23,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:25:23,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:25:23,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:25:23,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:25:23,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:25:23,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:25:23,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:23,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:23,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:25:23,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:25:23,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:25:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793266127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:23,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:25:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:25:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046477670] [2025-03-04 01:25:23,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:25:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:23,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:25:23,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:25:23,383 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:25:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:23,408 INFO L93 Difference]: Finished difference Result 208 states and 323 transitions. [2025-03-04 01:25:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:25:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-03-04 01:25:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:23,413 INFO L225 Difference]: With dead ends: 208 [2025-03-04 01:25:23,413 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 01:25:23,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:25:23,417 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:23,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:25:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 01:25:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 01:25:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:25:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2025-03-04 01:25:23,447 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 107 [2025-03-04 01:25:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:23,447 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2025-03-04 01:25:23,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:25:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2025-03-04 01:25:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:25:23,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:23,453 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:23,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:25:23,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:25:23,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:23,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash -645218232, now seen corresponding path program 1 times [2025-03-04 01:25:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:23,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414328202] [2025-03-04 01:25:23,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:23,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:25:23,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:25:23,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:23,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414328202] [2025-03-04 01:25:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414328202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:24,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125616499] [2025-03-04 01:25:24,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:24,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:24,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:24,257 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:24,504 INFO L93 Difference]: Finished difference Result 306 states and 453 transitions. [2025-03-04 01:25:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-04 01:25:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:24,507 INFO L225 Difference]: With dead ends: 306 [2025-03-04 01:25:24,509 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 01:25:24,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:24,511 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 153 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:24,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 718 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:25:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 01:25:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-03-04 01:25:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 173 states have (on average 1.4335260115606936) internal successors, (248), 173 states have internal predecessors, (248), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:25:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2025-03-04 01:25:24,534 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 107 [2025-03-04 01:25:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:24,534 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2025-03-04 01:25:24,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2025-03-04 01:25:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:25:24,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:24,537 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:24,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:25:24,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:24,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash 694159233, now seen corresponding path program 1 times [2025-03-04 01:25:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886284892] [2025-03-04 01:25:24,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:24,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:25:24,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:25:24,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:24,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:24,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:24,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886284892] [2025-03-04 01:25:24,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886284892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:24,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:25:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271078655] [2025-03-04 01:25:24,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:24,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:25:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:24,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:25:24,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:25:24,946 INFO L87 Difference]: Start difference. First operand 200 states and 296 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:25,024 INFO L93 Difference]: Finished difference Result 303 states and 449 transitions. [2025-03-04 01:25:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:25,025 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-04 01:25:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:25,026 INFO L225 Difference]: With dead ends: 303 [2025-03-04 01:25:25,028 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 01:25:25,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-04 01:25:25,030 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 5 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:25,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 525 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 01:25:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2025-03-04 01:25:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 174 states have (on average 1.4310344827586208) internal successors, (249), 174 states have internal predecessors, (249), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:25:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 297 transitions. [2025-03-04 01:25:25,041 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 297 transitions. Word has length 108 [2025-03-04 01:25:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:25,041 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 297 transitions. [2025-03-04 01:25:25,041 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 297 transitions. [2025-03-04 01:25:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:25:25,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:25,046 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:25,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:25:25,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:25,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:25,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2047468930, now seen corresponding path program 1 times [2025-03-04 01:25:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:25,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658388189] [2025-03-04 01:25:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:25,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:25:25,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:25:25,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:25,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:25,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658388189] [2025-03-04 01:25:25,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658388189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:25,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:25:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499764321] [2025-03-04 01:25:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:25,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:25:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:25,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:25:25,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:25,451 INFO L87 Difference]: Start difference. First operand 201 states and 297 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:25,719 INFO L93 Difference]: Finished difference Result 403 states and 596 transitions. [2025-03-04 01:25:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:25:25,720 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-04 01:25:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:25,722 INFO L225 Difference]: With dead ends: 403 [2025-03-04 01:25:25,722 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 01:25:25,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:25:25,723 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 146 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:25,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 966 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:25:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 01:25:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2025-03-04 01:25:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 256 states have (on average 1.42578125) internal successors, (365), 256 states have internal predecessors, (365), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:25:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 437 transitions. [2025-03-04 01:25:25,749 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 437 transitions. Word has length 108 [2025-03-04 01:25:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:25,749 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 437 transitions. [2025-03-04 01:25:25,749 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 437 transitions. [2025-03-04 01:25:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:25:25,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:25,750 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:25,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:25:25,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2118415647, now seen corresponding path program 1 times [2025-03-04 01:25:25,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:25,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710506154] [2025-03-04 01:25:25,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:25,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:25,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:25:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:25:25,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:25:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710506154] [2025-03-04 01:25:26,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710506154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:25:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386555967] [2025-03-04 01:25:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:25:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:25:26,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:25:26,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:25:26,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:25:26,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:25:26,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:26,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:26,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 01:25:26,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:26,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:25:27,421 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 30 treesize of output 18 [2025-03-04 01:25:27,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:25:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:25:27,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:25:27,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-04 01:25:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:25:28,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386555967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:25:28,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:25:28,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 35 [2025-03-04 01:25:28,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112759619] [2025-03-04 01:25:28,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:25:28,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 01:25:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:28,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 01:25:28,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:25:28,014 INFO L87 Difference]: Start difference. First operand 296 states and 437 transitions. Second operand has 35 states, 32 states have (on average 3.5) internal successors, (112), 32 states have internal predecessors, (112), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-04 01:25:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:31,239 INFO L93 Difference]: Finished difference Result 1592 states and 2338 transitions. [2025-03-04 01:25:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 01:25:31,240 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 3.5) internal successors, (112), 32 states have internal predecessors, (112), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 5 states have call successors, (36) Word has length 108 [2025-03-04 01:25:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:31,249 INFO L225 Difference]: With dead ends: 1592 [2025-03-04 01:25:31,249 INFO L226 Difference]: Without dead ends: 1299 [2025-03-04 01:25:31,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1400, Invalid=6790, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 01:25:31,255 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2276 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 4120 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:31,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2276 Valid, 4120 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:25:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-04 01:25:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 867. [2025-03-04 01:25:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 754 states have (on average 1.3925729442970822) internal successors, (1050), 754 states have internal predecessors, (1050), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1242 transitions. [2025-03-04 01:25:31,317 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1242 transitions. Word has length 108 [2025-03-04 01:25:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:31,318 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1242 transitions. [2025-03-04 01:25:31,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 3.5) internal successors, (112), 32 states have internal predecessors, (112), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-04 01:25:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1242 transitions. [2025-03-04 01:25:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:25:31,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:31,319 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:31,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:25:31,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:25:31,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:31,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1277337990, now seen corresponding path program 1 times [2025-03-04 01:25:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943891299] [2025-03-04 01:25:31,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:31,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:25:31,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:25:31,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:31,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943891299] [2025-03-04 01:25:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943891299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:31,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276026598] [2025-03-04 01:25:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:31,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:31,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:31,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:31,732 INFO L87 Difference]: Start difference. First operand 867 states and 1242 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:31,885 INFO L93 Difference]: Finished difference Result 1733 states and 2486 transitions. [2025-03-04 01:25:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-04 01:25:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:31,889 INFO L225 Difference]: With dead ends: 1733 [2025-03-04 01:25:31,890 INFO L226 Difference]: Without dead ends: 869 [2025-03-04 01:25:31,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:31,891 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 151 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:31,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 701 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-04 01:25:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 861. [2025-03-04 01:25:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 748 states have (on average 1.3877005347593583) internal successors, (1038), 748 states have internal predecessors, (1038), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1230 transitions. [2025-03-04 01:25:31,942 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1230 transitions. Word has length 109 [2025-03-04 01:25:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:31,942 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1230 transitions. [2025-03-04 01:25:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1230 transitions. [2025-03-04 01:25:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:25:31,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:31,946 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:31,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:25:31,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -71106945, now seen corresponding path program 1 times [2025-03-04 01:25:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127730246] [2025-03-04 01:25:31,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:31,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:25:31,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:25:31,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:31,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:32,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:32,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127730246] [2025-03-04 01:25:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127730246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:32,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47051579] [2025-03-04 01:25:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:32,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:32,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:32,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:32,129 INFO L87 Difference]: Start difference. First operand 861 states and 1230 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:32,291 INFO L93 Difference]: Finished difference Result 1809 states and 2585 transitions. [2025-03-04 01:25:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:25:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-04 01:25:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:32,299 INFO L225 Difference]: With dead ends: 1809 [2025-03-04 01:25:32,299 INFO L226 Difference]: Without dead ends: 1271 [2025-03-04 01:25:32,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:32,301 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:32,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 514 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-04 01:25:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1263. [2025-03-04 01:25:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1094 states have (on average 1.3793418647166362) internal successors, (1509), 1094 states have internal predecessors, (1509), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1797 transitions. [2025-03-04 01:25:32,375 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1797 transitions. Word has length 110 [2025-03-04 01:25:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:32,375 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1797 transitions. [2025-03-04 01:25:32,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1797 transitions. [2025-03-04 01:25:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:25:32,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:32,377 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:32,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:25:32,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:32,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -558962402, now seen corresponding path program 1 times [2025-03-04 01:25:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:32,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404030080] [2025-03-04 01:25:32,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:32,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:32,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:25:32,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:25:32,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:32,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:32,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404030080] [2025-03-04 01:25:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404030080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:32,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:32,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:32,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671649926] [2025-03-04 01:25:32,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:32,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:32,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:32,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:32,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:32,560 INFO L87 Difference]: Start difference. First operand 1263 states and 1797 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:32,751 INFO L93 Difference]: Finished difference Result 2536 states and 3609 transitions. [2025-03-04 01:25:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:32,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-04 01:25:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:32,757 INFO L225 Difference]: With dead ends: 2536 [2025-03-04 01:25:32,757 INFO L226 Difference]: Without dead ends: 1276 [2025-03-04 01:25:32,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:32,759 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 150 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:32,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 722 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-03-04 01:25:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1265. [2025-03-04 01:25:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1096 states have (on average 1.3777372262773722) internal successors, (1510), 1096 states have internal predecessors, (1510), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1798 transitions. [2025-03-04 01:25:32,814 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1798 transitions. Word has length 110 [2025-03-04 01:25:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:32,815 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1798 transitions. [2025-03-04 01:25:32,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1798 transitions. [2025-03-04 01:25:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:25:32,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:32,817 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:25:32,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:32,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 588917573, now seen corresponding path program 1 times [2025-03-04 01:25:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177857727] [2025-03-04 01:25:32,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:32,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:25:32,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:25:32,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:32,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:33,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:33,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177857727] [2025-03-04 01:25:33,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177857727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:33,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:33,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:33,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825850951] [2025-03-04 01:25:33,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:33,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:33,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:33,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:33,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:33,002 INFO L87 Difference]: Start difference. First operand 1265 states and 1798 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:33,172 INFO L93 Difference]: Finished difference Result 2223 states and 3160 transitions. [2025-03-04 01:25:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:25:33,172 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-04 01:25:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:33,179 INFO L225 Difference]: With dead ends: 2223 [2025-03-04 01:25:33,179 INFO L226 Difference]: Without dead ends: 1283 [2025-03-04 01:25:33,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:33,182 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 149 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:33,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 633 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-03-04 01:25:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1267. [2025-03-04 01:25:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1098 states have (on average 1.3761384335154827) internal successors, (1511), 1098 states have internal predecessors, (1511), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1799 transitions. [2025-03-04 01:25:33,236 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1799 transitions. Word has length 111 [2025-03-04 01:25:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:33,237 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1799 transitions. [2025-03-04 01:25:33,237 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1799 transitions. [2025-03-04 01:25:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:25:33,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:33,239 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:33,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:25:33,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:33,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash 484509700, now seen corresponding path program 1 times [2025-03-04 01:25:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:33,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932728482] [2025-03-04 01:25:33,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:33,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:25:33,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:25:33,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:33,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932728482] [2025-03-04 01:25:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932728482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:25:33,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906342288] [2025-03-04 01:25:33,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:25:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:33,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:25:33,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:25:33,384 INFO L87 Difference]: Start difference. First operand 1267 states and 1799 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:33,475 INFO L93 Difference]: Finished difference Result 2525 states and 3588 transitions. [2025-03-04 01:25:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:25:33,476 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-04 01:25:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:33,482 INFO L225 Difference]: With dead ends: 2525 [2025-03-04 01:25:33,482 INFO L226 Difference]: Without dead ends: 1261 [2025-03-04 01:25:33,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:33,484 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 147 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:33,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 607 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:25:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-04 01:25:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1259. [2025-03-04 01:25:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1090 states have (on average 1.3743119266055046) internal successors, (1498), 1090 states have internal predecessors, (1498), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1786 transitions. [2025-03-04 01:25:33,538 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1786 transitions. Word has length 111 [2025-03-04 01:25:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1786 transitions. [2025-03-04 01:25:33,539 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1786 transitions. [2025-03-04 01:25:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:25:33,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:33,541 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:33,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:25:33,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:33,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash -512562653, now seen corresponding path program 1 times [2025-03-04 01:25:33,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781391978] [2025-03-04 01:25:33,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:33,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:25:33,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:25:33,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:33,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:33,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781391978] [2025-03-04 01:25:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781391978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:33,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979159245] [2025-03-04 01:25:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:33,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:33,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:33,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:33,706 INFO L87 Difference]: Start difference. First operand 1259 states and 1786 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:33,851 INFO L93 Difference]: Finished difference Result 2517 states and 3570 transitions. [2025-03-04 01:25:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:33,852 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-04 01:25:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:33,859 INFO L225 Difference]: With dead ends: 2517 [2025-03-04 01:25:33,859 INFO L226 Difference]: Without dead ends: 1261 [2025-03-04 01:25:33,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:33,863 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 238 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:33,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 634 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-04 01:25:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1259. [2025-03-04 01:25:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1090 states have (on average 1.3651376146788992) internal successors, (1488), 1090 states have internal predecessors, (1488), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1776 transitions. [2025-03-04 01:25:33,922 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1776 transitions. Word has length 111 [2025-03-04 01:25:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:33,922 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1776 transitions. [2025-03-04 01:25:33,922 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1776 transitions. [2025-03-04 01:25:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:25:33,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:33,926 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:33,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:25:33,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:33,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash 324935770, now seen corresponding path program 1 times [2025-03-04 01:25:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555381615] [2025-03-04 01:25:33,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:33,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:25:33,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:25:33,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:33,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555381615] [2025-03-04 01:25:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555381615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:34,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:25:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833465419] [2025-03-04 01:25:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:25:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:34,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:25:34,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:25:34,369 INFO L87 Difference]: Start difference. First operand 1259 states and 1776 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:34,891 INFO L93 Difference]: Finished difference Result 2498 states and 3510 transitions. [2025-03-04 01:25:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:25:34,892 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-04 01:25:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:34,900 INFO L225 Difference]: With dead ends: 2498 [2025-03-04 01:25:34,900 INFO L226 Difference]: Without dead ends: 1752 [2025-03-04 01:25:34,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:25:34,903 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 474 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:34,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 940 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:25:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-04 01:25:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1451. [2025-03-04 01:25:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1254 states have (on average 1.3564593301435406) internal successors, (1701), 1254 states have internal predecessors, (1701), 168 states have call successors, (168), 28 states have call predecessors, (168), 28 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-04 01:25:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2037 transitions. [2025-03-04 01:25:34,974 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2037 transitions. Word has length 111 [2025-03-04 01:25:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:34,974 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 2037 transitions. [2025-03-04 01:25:34,975 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2037 transitions. [2025-03-04 01:25:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:25:34,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:34,976 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:34,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:25:34,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:34,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash 685863925, now seen corresponding path program 1 times [2025-03-04 01:25:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680664907] [2025-03-04 01:25:34,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:34,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:25:34,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:25:34,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:34,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:25:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680664907] [2025-03-04 01:25:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680664907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:25:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076862136] [2025-03-04 01:25:35,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:35,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:25:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:25:35,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:25:35,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:25:35,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:25:35,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:25:35,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:35,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:35,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:25:35,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:35,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:25:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076862136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:35,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:25:35,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:25:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726911517] [2025-03-04 01:25:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:35,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:25:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:35,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:25:35,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:25:35,279 INFO L87 Difference]: Start difference. First operand 1451 states and 2037 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:35,345 INFO L93 Difference]: Finished difference Result 2941 states and 4127 transitions. [2025-03-04 01:25:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:35,346 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-04 01:25:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:35,351 INFO L225 Difference]: With dead ends: 2941 [2025-03-04 01:25:35,351 INFO L226 Difference]: Without dead ends: 1493 [2025-03-04 01:25:35,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 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-04 01:25:35,355 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:35,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:25:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2025-03-04 01:25:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2025-03-04 01:25:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1296 states have (on average 1.3449074074074074) internal successors, (1743), 1296 states have internal predecessors, (1743), 168 states have call successors, (168), 28 states have call predecessors, (168), 28 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-04 01:25:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2079 transitions. [2025-03-04 01:25:35,422 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2079 transitions. Word has length 111 [2025-03-04 01:25:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:35,422 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 2079 transitions. [2025-03-04 01:25:35,422 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2079 transitions. [2025-03-04 01:25:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:25:35,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:35,424 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:35,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:25:35,625 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-04 01:25:35,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:35,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1738625834, now seen corresponding path program 1 times [2025-03-04 01:25:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877463371] [2025-03-04 01:25:35,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:35,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:25:35,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:25:35,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:35,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877463371] [2025-03-04 01:25:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877463371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:35,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:35,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:25:35,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633466261] [2025-03-04 01:25:35,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:35,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:25:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:35,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:25:35,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:35,829 INFO L87 Difference]: Start difference. First operand 1493 states and 2079 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:36,013 INFO L93 Difference]: Finished difference Result 2460 states and 3424 transitions. [2025-03-04 01:25:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:25:36,014 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-04 01:25:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:36,022 INFO L225 Difference]: With dead ends: 2460 [2025-03-04 01:25:36,022 INFO L226 Difference]: Without dead ends: 1503 [2025-03-04 01:25:36,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:25:36,024 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 239 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:36,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 697 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-03-04 01:25:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1495. [2025-03-04 01:25:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1298 states have (on average 1.3443759630200307) internal successors, (1745), 1298 states have internal predecessors, (1745), 168 states have call successors, (168), 28 states have call predecessors, (168), 28 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-04 01:25:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2081 transitions. [2025-03-04 01:25:36,080 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2081 transitions. Word has length 111 [2025-03-04 01:25:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:36,081 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 2081 transitions. [2025-03-04 01:25:36,081 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2081 transitions. [2025-03-04 01:25:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:25:36,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:36,082 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:36,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:25:36,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:36,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:36,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1331800605, now seen corresponding path program 1 times [2025-03-04 01:25:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:36,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071644212] [2025-03-04 01:25:36,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:36,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:25:36,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:25:36,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:36,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071644212] [2025-03-04 01:25:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071644212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:36,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:36,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:25:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024793259] [2025-03-04 01:25:36,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:36,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:25:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:36,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:25:36,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:36,250 INFO L87 Difference]: Start difference. First operand 1495 states and 2081 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:36,418 INFO L93 Difference]: Finished difference Result 2243 states and 3120 transitions. [2025-03-04 01:25:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:25:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-03-04 01:25:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:36,424 INFO L225 Difference]: With dead ends: 2243 [2025-03-04 01:25:36,424 INFO L226 Difference]: Without dead ends: 1505 [2025-03-04 01:25:36,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:36,427 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 139 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:36,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 740 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-04 01:25:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1497. [2025-03-04 01:25:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1300 states have (on average 1.343846153846154) internal successors, (1747), 1300 states have internal predecessors, (1747), 168 states have call successors, (168), 28 states have call predecessors, (168), 28 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-04 01:25:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2083 transitions. [2025-03-04 01:25:36,485 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2083 transitions. Word has length 112 [2025-03-04 01:25:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:36,485 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 2083 transitions. [2025-03-04 01:25:36,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2083 transitions. [2025-03-04 01:25:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:25:36,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:36,486 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:25:36,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -543653786, now seen corresponding path program 1 times [2025-03-04 01:25:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870818044] [2025-03-04 01:25:36,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:36,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:25:36,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:25:36,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:36,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870818044] [2025-03-04 01:25:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870818044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:36,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:36,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:25:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902866300] [2025-03-04 01:25:36,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:36,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:25:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:36,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:25:36,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:25:36,863 INFO L87 Difference]: Start difference. First operand 1497 states and 2083 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:37,345 INFO L93 Difference]: Finished difference Result 2460 states and 3413 transitions. [2025-03-04 01:25:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:25:37,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-03-04 01:25:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:37,351 INFO L225 Difference]: With dead ends: 2460 [2025-03-04 01:25:37,352 INFO L226 Difference]: Without dead ends: 1707 [2025-03-04 01:25:37,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:25:37,354 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 234 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:37,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1572 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:25:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-03-04 01:25:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1394. [2025-03-04 01:25:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1211 states have (on average 1.3393889347646573) internal successors, (1622), 1211 states have internal predecessors, (1622), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-04 01:25:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1934 transitions. [2025-03-04 01:25:37,425 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1934 transitions. Word has length 112 [2025-03-04 01:25:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:37,425 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1934 transitions. [2025-03-04 01:25:37,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1934 transitions. [2025-03-04 01:25:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:25:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:37,427 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:37,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:25:37,427 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1188887749, now seen corresponding path program 1 times [2025-03-04 01:25:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320595055] [2025-03-04 01:25:37,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:37,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:25:37,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:25:37,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:37,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320595055] [2025-03-04 01:25:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320595055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:37,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297923003] [2025-03-04 01:25:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:37,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:37,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:37,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:37,605 INFO L87 Difference]: Start difference. First operand 1394 states and 1934 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:37,763 INFO L93 Difference]: Finished difference Result 2796 states and 3879 transitions. [2025-03-04 01:25:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:37,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-03-04 01:25:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:37,770 INFO L225 Difference]: With dead ends: 2796 [2025-03-04 01:25:37,771 INFO L226 Difference]: Without dead ends: 1405 [2025-03-04 01:25:37,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:37,773 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 239 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:37,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 578 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-03-04 01:25:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1394. [2025-03-04 01:25:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1211 states have (on average 1.3369116432700248) internal successors, (1619), 1211 states have internal predecessors, (1619), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-04 01:25:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1931 transitions. [2025-03-04 01:25:37,826 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1931 transitions. Word has length 112 [2025-03-04 01:25:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:37,826 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1931 transitions. [2025-03-04 01:25:37,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1931 transitions. [2025-03-04 01:25:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:25:37,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:37,828 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:37,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:25:37,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:37,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 494948652, now seen corresponding path program 1 times [2025-03-04 01:25:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:37,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490852254] [2025-03-04 01:25:37,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:37,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:37,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:37,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:37,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490852254] [2025-03-04 01:25:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490852254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:37,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:37,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549399721] [2025-03-04 01:25:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:37,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:37,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:37,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:37,990 INFO L87 Difference]: Start difference. First operand 1394 states and 1931 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:38,164 INFO L93 Difference]: Finished difference Result 2468 states and 3418 transitions. [2025-03-04 01:25:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:25:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:25:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:38,170 INFO L225 Difference]: With dead ends: 2468 [2025-03-04 01:25:38,170 INFO L226 Difference]: Without dead ends: 1408 [2025-03-04 01:25:38,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:38,173 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 135 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:38,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 683 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-04 01:25:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1394. [2025-03-04 01:25:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1211 states have (on average 1.3344343517753923) internal successors, (1616), 1211 states have internal predecessors, (1616), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-04 01:25:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1928 transitions. [2025-03-04 01:25:38,224 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1928 transitions. Word has length 113 [2025-03-04 01:25:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:38,225 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1928 transitions. [2025-03-04 01:25:38,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1928 transitions. [2025-03-04 01:25:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:25:38,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:38,227 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:38,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:25:38,227 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:38,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 181305929, now seen corresponding path program 1 times [2025-03-04 01:25:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:38,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608956713] [2025-03-04 01:25:38,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:38,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:38,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:38,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:38,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:38,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608956713] [2025-03-04 01:25:38,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608956713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:38,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:38,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012497531] [2025-03-04 01:25:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:38,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:38,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:38,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:38,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:38,348 INFO L87 Difference]: Start difference. First operand 1394 states and 1928 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:38,501 INFO L93 Difference]: Finished difference Result 2258 states and 3130 transitions. [2025-03-04 01:25:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:25:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:25:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:38,506 INFO L225 Difference]: With dead ends: 2258 [2025-03-04 01:25:38,506 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 01:25:38,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:38,508 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 150 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:38,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 628 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 01:25:38,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 859. [2025-03-04 01:25:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 746 states have (on average 1.339142091152815) internal successors, (999), 746 states have internal predecessors, (999), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1191 transitions. [2025-03-04 01:25:38,546 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1191 transitions. Word has length 113 [2025-03-04 01:25:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:38,547 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1191 transitions. [2025-03-04 01:25:38,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1191 transitions. [2025-03-04 01:25:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:25:38,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:38,548 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:38,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:25:38,548 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1442878044, now seen corresponding path program 1 times [2025-03-04 01:25:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:38,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794658926] [2025-03-04 01:25:38,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:38,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:38,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:38,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794658926] [2025-03-04 01:25:38,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794658926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:38,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:38,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436775133] [2025-03-04 01:25:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:38,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:38,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:38,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:38,688 INFO L87 Difference]: Start difference. First operand 859 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:38,809 INFO L93 Difference]: Finished difference Result 1711 states and 2370 transitions. [2025-03-04 01:25:38,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:38,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:25:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:38,813 INFO L225 Difference]: With dead ends: 1711 [2025-03-04 01:25:38,813 INFO L226 Difference]: Without dead ends: 855 [2025-03-04 01:25:38,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:38,817 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 223 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:38,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 620 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-04 01:25:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 853. [2025-03-04 01:25:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 740 states have (on average 1.3337837837837838) internal successors, (987), 740 states have internal predecessors, (987), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1179 transitions. [2025-03-04 01:25:38,856 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1179 transitions. Word has length 113 [2025-03-04 01:25:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:38,856 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1179 transitions. [2025-03-04 01:25:38,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1179 transitions. [2025-03-04 01:25:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:25:38,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:38,859 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:38,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:25:38,859 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:38,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1494103362, now seen corresponding path program 1 times [2025-03-04 01:25:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:38,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508062938] [2025-03-04 01:25:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:38,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:38,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:38,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:39,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:39,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508062938] [2025-03-04 01:25:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508062938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:39,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:25:39,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064671284] [2025-03-04 01:25:39,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:39,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:25:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:39,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:25:39,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:39,063 INFO L87 Difference]: Start difference. First operand 853 states and 1179 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:39,240 INFO L93 Difference]: Finished difference Result 1707 states and 2359 transitions. [2025-03-04 01:25:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:25:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:25:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:39,243 INFO L225 Difference]: With dead ends: 1707 [2025-03-04 01:25:39,243 INFO L226 Difference]: Without dead ends: 857 [2025-03-04 01:25:39,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:25:39,245 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 147 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:39,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1130 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-03-04 01:25:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 855. [2025-03-04 01:25:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 742 states have (on average 1.3328840970350404) internal successors, (989), 742 states have internal predecessors, (989), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1181 transitions. [2025-03-04 01:25:39,273 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1181 transitions. Word has length 113 [2025-03-04 01:25:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:39,274 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1181 transitions. [2025-03-04 01:25:39,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1181 transitions. [2025-03-04 01:25:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:25:39,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:39,275 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:39,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:25:39,276 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:39,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash 582226007, now seen corresponding path program 1 times [2025-03-04 01:25:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:39,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596621563] [2025-03-04 01:25:39,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:39,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:40,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:40,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596621563] [2025-03-04 01:25:40,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596621563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:40,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:40,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:25:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009783311] [2025-03-04 01:25:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:40,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:25:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:40,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:25:40,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:25:40,057 INFO L87 Difference]: Start difference. First operand 855 states and 1181 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:40,888 INFO L93 Difference]: Finished difference Result 1538 states and 2116 transitions. [2025-03-04 01:25:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:25:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:25:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:40,892 INFO L225 Difference]: With dead ends: 1538 [2025-03-04 01:25:40,893 INFO L226 Difference]: Without dead ends: 1004 [2025-03-04 01:25:40,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:25:40,895 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 176 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:40,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1250 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:25:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-03-04 01:25:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 869. [2025-03-04 01:25:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 756 states have (on average 1.3293650793650793) internal successors, (1005), 756 states have internal predecessors, (1005), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1197 transitions. [2025-03-04 01:25:40,923 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1197 transitions. Word has length 113 [2025-03-04 01:25:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:40,923 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1197 transitions. [2025-03-04 01:25:40,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1197 transitions. [2025-03-04 01:25:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:25:40,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:40,924 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:40,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:25:40,924 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:40,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash 312101324, now seen corresponding path program 1 times [2025-03-04 01:25:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58683973] [2025-03-04 01:25:40,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:40,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:40,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:40,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:25:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58683973] [2025-03-04 01:25:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58683973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:25:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86763063] [2025-03-04 01:25:41,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:41,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:25:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:25:41,026 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-04 01:25:41,027 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-04 01:25:41,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:41,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:41,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:41,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:41,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:25:41,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:41,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:25:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86763063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:41,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:25:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:25:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142687359] [2025-03-04 01:25:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:25:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:41,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:25:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:41,216 INFO L87 Difference]: Start difference. First operand 869 states and 1197 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:41,257 INFO L93 Difference]: Finished difference Result 1759 states and 2423 transitions. [2025-03-04 01:25:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:25:41,257 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:25:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:41,267 INFO L225 Difference]: With dead ends: 1759 [2025-03-04 01:25:41,267 INFO L226 Difference]: Without dead ends: 893 [2025-03-04 01:25:41,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:41,269 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:41,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:25:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-04 01:25:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2025-03-04 01:25:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 780 states have (on average 1.3192307692307692) internal successors, (1029), 780 states have internal predecessors, (1029), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1221 transitions. [2025-03-04 01:25:41,298 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1221 transitions. Word has length 113 [2025-03-04 01:25:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:41,298 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1221 transitions. [2025-03-04 01:25:41,298 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1221 transitions. [2025-03-04 01:25:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:25:41,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:41,299 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:41,307 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-04 01:25:41,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:25:41,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:41,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1061069374, now seen corresponding path program 1 times [2025-03-04 01:25:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146522188] [2025-03-04 01:25:41,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:41,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:25:41,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:25:41,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:41,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:41,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146522188] [2025-03-04 01:25:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146522188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:41,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:41,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:25:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351511452] [2025-03-04 01:25:41,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:41,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:25:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:41,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:25:41,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:41,687 INFO L87 Difference]: Start difference. First operand 893 states and 1221 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:41,881 INFO L93 Difference]: Finished difference Result 1805 states and 2470 transitions. [2025-03-04 01:25:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:25:41,881 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:25:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:41,887 INFO L225 Difference]: With dead ends: 1805 [2025-03-04 01:25:41,887 INFO L226 Difference]: Without dead ends: 1242 [2025-03-04 01:25:41,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:25:41,888 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 148 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:41,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 854 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-03-04 01:25:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1234. [2025-03-04 01:25:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1079 states have (on average 1.3188137164040779) internal successors, (1423), 1079 states have internal predecessors, (1423), 132 states have call successors, (132), 22 states have call predecessors, (132), 22 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-04 01:25:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1687 transitions. [2025-03-04 01:25:41,926 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1687 transitions. Word has length 113 [2025-03-04 01:25:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:41,926 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1687 transitions. [2025-03-04 01:25:41,926 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1687 transitions. [2025-03-04 01:25:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:25:41,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:41,928 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:41,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:25:41,928 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:41,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1098344901, now seen corresponding path program 1 times [2025-03-04 01:25:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:41,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883817498] [2025-03-04 01:25:41,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:41,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:25:41,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:25:41,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:41,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:42,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883817498] [2025-03-04 01:25:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883817498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:42,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:42,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:25:42,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126070471] [2025-03-04 01:25:42,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:42,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:25:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:42,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:25:42,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:42,057 INFO L87 Difference]: Start difference. First operand 1234 states and 1687 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:42,217 INFO L93 Difference]: Finished difference Result 1809 states and 2474 transitions. [2025-03-04 01:25:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:25:42,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-04 01:25:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:42,221 INFO L225 Difference]: With dead ends: 1809 [2025-03-04 01:25:42,221 INFO L226 Difference]: Without dead ends: 1246 [2025-03-04 01:25:42,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:42,222 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 134 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:42,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 725 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-04 01:25:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 897. [2025-03-04 01:25:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 784 states have (on average 1.3176020408163265) internal successors, (1033), 784 states have internal predecessors, (1033), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1225 transitions. [2025-03-04 01:25:42,253 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1225 transitions. Word has length 114 [2025-03-04 01:25:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1225 transitions. [2025-03-04 01:25:42,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1225 transitions. [2025-03-04 01:25:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:25:42,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:42,254 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:42,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:25:42,255 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -247181660, now seen corresponding path program 1 times [2025-03-04 01:25:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869033051] [2025-03-04 01:25:42,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:42,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:25:42,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:25:42,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:42,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:42,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:42,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869033051] [2025-03-04 01:25:42,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869033051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:42,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:42,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81581407] [2025-03-04 01:25:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:42,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:42,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:42,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:42,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:42,421 INFO L87 Difference]: Start difference. First operand 897 states and 1225 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:42,583 INFO L93 Difference]: Finished difference Result 1792 states and 2449 transitions. [2025-03-04 01:25:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:25:42,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-04 01:25:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:42,586 INFO L225 Difference]: With dead ends: 1792 [2025-03-04 01:25:42,586 INFO L226 Difference]: Without dead ends: 898 [2025-03-04 01:25:42,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:42,591 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 135 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:42,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 828 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-04 01:25:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 887. [2025-03-04 01:25:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 774 states have (on average 1.3165374677002584) internal successors, (1019), 774 states have internal predecessors, (1019), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1211 transitions. [2025-03-04 01:25:42,619 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1211 transitions. Word has length 114 [2025-03-04 01:25:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:42,620 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1211 transitions. [2025-03-04 01:25:42,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1211 transitions. [2025-03-04 01:25:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:25:42,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:42,622 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:42,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:25:42,624 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:42,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash -35146654, now seen corresponding path program 1 times [2025-03-04 01:25:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:42,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455857983] [2025-03-04 01:25:42,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:42,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:42,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:25:42,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:25:42,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:42,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455857983] [2025-03-04 01:25:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455857983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:42,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:25:42,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339388312] [2025-03-04 01:25:42,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:42,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:42,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:42,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:25:42,787 INFO L87 Difference]: Start difference. First operand 887 states and 1211 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:43,155 INFO L93 Difference]: Finished difference Result 1999 states and 2722 transitions. [2025-03-04 01:25:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:25:43,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-04 01:25:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:43,161 INFO L225 Difference]: With dead ends: 1999 [2025-03-04 01:25:43,162 INFO L226 Difference]: Without dead ends: 1437 [2025-03-04 01:25:43,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:25:43,164 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 351 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:43,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1053 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:25:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-03-04 01:25:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 899. [2025-03-04 01:25:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 786 states have (on average 1.3231552162849873) internal successors, (1040), 786 states have internal predecessors, (1040), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:25:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1232 transitions. [2025-03-04 01:25:43,198 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1232 transitions. Word has length 114 [2025-03-04 01:25:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:43,198 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1232 transitions. [2025-03-04 01:25:43,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1232 transitions. [2025-03-04 01:25:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:25:43,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:43,200 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:43,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:25:43,200 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:43,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:43,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1209617827, now seen corresponding path program 1 times [2025-03-04 01:25:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:43,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942312658] [2025-03-04 01:25:43,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:43,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:43,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:25:43,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:25:43,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:43,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942312658] [2025-03-04 01:25:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942312658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:25:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160779464] [2025-03-04 01:25:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:25:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:43,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:25:43,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:43,433 INFO L87 Difference]: Start difference. First operand 899 states and 1232 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:43,855 INFO L93 Difference]: Finished difference Result 1948 states and 2675 transitions. [2025-03-04 01:25:43,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:25:43,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-04 01:25:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:43,859 INFO L225 Difference]: With dead ends: 1948 [2025-03-04 01:25:43,859 INFO L226 Difference]: Without dead ends: 1378 [2025-03-04 01:25:43,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:25:43,861 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 356 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:43,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1109 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:25:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-03-04 01:25:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1359. [2025-03-04 01:25:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1190 states have (on average 1.3277310924369747) internal successors, (1580), 1190 states have internal predecessors, (1580), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1868 transitions. [2025-03-04 01:25:43,922 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1868 transitions. Word has length 114 [2025-03-04 01:25:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:43,922 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1868 transitions. [2025-03-04 01:25:43,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1868 transitions. [2025-03-04 01:25:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:25:43,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:43,924 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:43,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:25:43,924 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:43,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1577797660, now seen corresponding path program 1 times [2025-03-04 01:25:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887720819] [2025-03-04 01:25:43,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:43,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:25:43,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:25:43,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:43,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:44,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887720819] [2025-03-04 01:25:44,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887720819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:44,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:44,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:25:44,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011944586] [2025-03-04 01:25:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:44,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:25:44,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:44,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:25:44,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:25:44,337 INFO L87 Difference]: Start difference. First operand 1359 states and 1868 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:44,800 INFO L93 Difference]: Finished difference Result 2518 states and 3447 transitions. [2025-03-04 01:25:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:25:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-04 01:25:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:44,805 INFO L225 Difference]: With dead ends: 2518 [2025-03-04 01:25:44,805 INFO L226 Difference]: Without dead ends: 1597 [2025-03-04 01:25:44,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:25:44,808 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 239 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:44,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1444 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:25:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-03-04 01:25:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1351. [2025-03-04 01:25:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1182 states have (on average 1.3214890016920473) internal successors, (1562), 1182 states have internal predecessors, (1562), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1850 transitions. [2025-03-04 01:25:44,862 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1850 transitions. Word has length 114 [2025-03-04 01:25:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1850 transitions. [2025-03-04 01:25:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1850 transitions. [2025-03-04 01:25:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:25:44,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:44,865 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:44,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:25:44,865 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 54076490, now seen corresponding path program 1 times [2025-03-04 01:25:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090716413] [2025-03-04 01:25:44,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:44,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:44,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:44,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:44,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:45,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090716413] [2025-03-04 01:25:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090716413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:45,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:45,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:25:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929226126] [2025-03-04 01:25:45,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:45,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:25:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:45,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:25:45,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:45,134 INFO L87 Difference]: Start difference. First operand 1351 states and 1850 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:45,678 INFO L93 Difference]: Finished difference Result 2511 states and 3415 transitions. [2025-03-04 01:25:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:25:45,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:25:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:45,683 INFO L225 Difference]: With dead ends: 2511 [2025-03-04 01:25:45,683 INFO L226 Difference]: Without dead ends: 1941 [2025-03-04 01:25:45,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:25:45,685 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 329 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:45,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1473 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:25:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2025-03-04 01:25:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1465. [2025-03-04 01:25:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1282 states have (on average 1.3221528861154446) internal successors, (1695), 1282 states have internal predecessors, (1695), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-04 01:25:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2007 transitions. [2025-03-04 01:25:45,742 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2007 transitions. Word has length 115 [2025-03-04 01:25:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:45,743 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 2007 transitions. [2025-03-04 01:25:45,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2007 transitions. [2025-03-04 01:25:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:25:45,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:45,744 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:45,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:25:45,744 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1561628299, now seen corresponding path program 1 times [2025-03-04 01:25:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501140072] [2025-03-04 01:25:45,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:45,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:45,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:45,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:45,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:46,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501140072] [2025-03-04 01:25:46,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501140072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:46,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:25:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696086824] [2025-03-04 01:25:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:46,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:25:46,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:46,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:25:46,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:46,080 INFO L87 Difference]: Start difference. First operand 1465 states and 2007 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:46,349 INFO L93 Difference]: Finished difference Result 2455 states and 3340 transitions. [2025-03-04 01:25:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:25:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:25:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:46,354 INFO L225 Difference]: With dead ends: 2455 [2025-03-04 01:25:46,354 INFO L226 Difference]: Without dead ends: 1766 [2025-03-04 01:25:46,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:25:46,356 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:46,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1170 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:25:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-03-04 01:25:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1343. [2025-03-04 01:25:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1174 states have (on average 1.3168654173764907) internal successors, (1546), 1174 states have internal predecessors, (1546), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:25:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1834 transitions. [2025-03-04 01:25:46,407 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1834 transitions. Word has length 115 [2025-03-04 01:25:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:46,407 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1834 transitions. [2025-03-04 01:25:46,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1834 transitions. [2025-03-04 01:25:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:25:46,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:46,409 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:46,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:25:46,409 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:46,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1182927321, now seen corresponding path program 1 times [2025-03-04 01:25:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281498344] [2025-03-04 01:25:46,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:46,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:46,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281498344] [2025-03-04 01:25:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281498344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:25:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014941400] [2025-03-04 01:25:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:46,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:25:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:46,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:25:46,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:25:46,476 INFO L87 Difference]: Start difference. First operand 1343 states and 1834 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:46,508 INFO L93 Difference]: Finished difference Result 2030 states and 2768 transitions. [2025-03-04 01:25:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:25:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:25:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:46,512 INFO L225 Difference]: With dead ends: 2030 [2025-03-04 01:25:46,512 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 01:25:46,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:25:46,514 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:46,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:25:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 01:25:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678. [2025-03-04 01:25:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 593 states have (on average 1.3035413153456998) internal successors, (773), 593 states have internal predecessors, (773), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-04 01:25:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 917 transitions. [2025-03-04 01:25:46,542 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 917 transitions. Word has length 115 [2025-03-04 01:25:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:46,542 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 917 transitions. [2025-03-04 01:25:46,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 917 transitions. [2025-03-04 01:25:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:25:46,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:46,544 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:46,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:25:46,544 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:46,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1277008974, now seen corresponding path program 1 times [2025-03-04 01:25:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896420963] [2025-03-04 01:25:46,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:46,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:46,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:46,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:46,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:46,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:46,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896420963] [2025-03-04 01:25:46,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896420963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:46,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:46,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:25:46,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854412730] [2025-03-04 01:25:46,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:46,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:25:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:46,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:25:46,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:46,794 INFO L87 Difference]: Start difference. First operand 678 states and 917 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:46,971 INFO L93 Difference]: Finished difference Result 1302 states and 1751 transitions. [2025-03-04 01:25:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:25:46,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:25:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:46,975 INFO L225 Difference]: With dead ends: 1302 [2025-03-04 01:25:46,975 INFO L226 Difference]: Without dead ends: 969 [2025-03-04 01:25:46,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:25:46,977 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 107 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:46,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1152 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-04 01:25:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 955. [2025-03-04 01:25:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 846 states have (on average 1.3073286052009456) internal successors, (1106), 849 states have internal predecessors, (1106), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:25:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1286 transitions. [2025-03-04 01:25:47,011 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1286 transitions. Word has length 115 [2025-03-04 01:25:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:47,012 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1286 transitions. [2025-03-04 01:25:47,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1286 transitions. [2025-03-04 01:25:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:25:47,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:47,013 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:47,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:25:47,013 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1202021020, now seen corresponding path program 1 times [2025-03-04 01:25:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752077913] [2025-03-04 01:25:47,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:47,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:47,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:47,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752077913] [2025-03-04 01:25:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752077913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:25:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487881033] [2025-03-04 01:25:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:25:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:47,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:25:47,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:25:47,374 INFO L87 Difference]: Start difference. First operand 955 states and 1286 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:47,578 INFO L93 Difference]: Finished difference Result 1594 states and 2145 transitions. [2025-03-04 01:25:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:25:47,579 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:25:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:47,583 INFO L225 Difference]: With dead ends: 1594 [2025-03-04 01:25:47,584 INFO L226 Difference]: Without dead ends: 963 [2025-03-04 01:25:47,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:25:47,585 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 152 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:47,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 799 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-04 01:25:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 955. [2025-03-04 01:25:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 846 states have (on average 1.3061465721040189) internal successors, (1105), 849 states have internal predecessors, (1105), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:25:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1285 transitions. [2025-03-04 01:25:47,654 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1285 transitions. Word has length 115 [2025-03-04 01:25:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:47,654 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1285 transitions. [2025-03-04 01:25:47,654 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1285 transitions. [2025-03-04 01:25:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:25:47,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:47,655 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:47,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:25:47,655 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 305530789, now seen corresponding path program 1 times [2025-03-04 01:25:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295199549] [2025-03-04 01:25:47,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:47,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:47,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:47,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:47,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:25:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295199549] [2025-03-04 01:25:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295199549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:47,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:47,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:25:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19162626] [2025-03-04 01:25:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:47,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:25:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:25:47,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:25:47,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:25:47,973 INFO L87 Difference]: Start difference. First operand 955 states and 1285 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:48,382 INFO L93 Difference]: Finished difference Result 1606 states and 2159 transitions. [2025-03-04 01:25:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:25:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:25:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:48,386 INFO L225 Difference]: With dead ends: 1606 [2025-03-04 01:25:48,386 INFO L226 Difference]: Without dead ends: 959 [2025-03-04 01:25:48,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:25:48,388 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 272 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:48,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1287 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:25:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-04 01:25:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 946. [2025-03-04 01:25:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 837 states have (on average 1.3046594982078854) internal successors, (1092), 840 states have internal predecessors, (1092), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:25:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1272 transitions. [2025-03-04 01:25:48,431 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1272 transitions. Word has length 115 [2025-03-04 01:25:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:48,432 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1272 transitions. [2025-03-04 01:25:48,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1272 transitions. [2025-03-04 01:25:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:25:48,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:48,433 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:48,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:25:48,433 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:48,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1550295270, now seen corresponding path program 1 times [2025-03-04 01:25:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:25:48,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487710579] [2025-03-04 01:25:48,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:25:48,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:48,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:48,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:48,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:25:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556920990] [2025-03-04 01:25:48,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:48,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:25:48,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:25:48,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:25:48,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:25:48,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:49,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:49,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:49,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:25:49,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:25:49,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:25:49,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:25:49,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:49,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:25:49,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:25:49,232 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:25:49,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:25:49,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:25:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 01:25:49,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:49,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:25:49,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:25:49 BoogieIcfgContainer [2025-03-04 01:25:49,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:25:49,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:25:49,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:25:49,556 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:25:49,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:25:22" (3/4) ... [2025-03-04 01:25:49,558 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:25:49,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:25:49,559 INFO L158 Benchmark]: Toolchain (without parser) took 27908.93ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.5MB in the beginning and 135.4MB in the end (delta: -12.9MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. [2025-03-04 01:25:49,559 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:25:49,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.55ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 108.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:25:49,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.15ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 104.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:25:49,559 INFO L158 Benchmark]: Boogie Preprocessor took 58.07ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 100.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:25:49,560 INFO L158 Benchmark]: IcfgBuilder took 746.27ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 59.8MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:25:49,560 INFO L158 Benchmark]: TraceAbstraction took 26816.05ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 59.3MB in the beginning and 135.5MB in the end (delta: -76.2MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2025-03-04 01:25:49,560 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 293.6MB. Free memory was 135.5MB in the beginning and 135.4MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:25:49,560 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.86ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.55ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 108.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.15ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 104.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.07ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 100.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 746.27ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 59.8MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26816.05ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 59.3MB in the beginning and 135.5MB in the end (delta: -76.2MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 293.6MB. Free memory was 135.5MB in the beginning and 135.4MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of bitwiseOr at line 64, overapproximation of bitwiseOr at line 99, overapproximation of bitwiseAnd at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L22] float var_1_1 = 99.25; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_7 = 18477; [L24] signed short int var_1_7 = 18477; [L25] signed short int* var_1_7_Pointer = &(var_1_7); [L26] signed short int var_1_8 = 5; [L26] signed short int var_1_8 = 5; [L27] signed short int* var_1_8_Pointer = &(var_1_8); [L28] float var_1_9 = 5.8; [L28] float var_1_9 = 5.8; [L29] float* var_1_9_Pointer = &(var_1_9); [L30] float var_1_10 = 0.5; [L30] float var_1_10 = 0.5; [L31] float* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_11 = 16; [L32] unsigned char var_1_11 = 16; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] unsigned char var_1_12 = 50; [L34] unsigned char var_1_12 = 50; [L35] unsigned char* var_1_12_Pointer = &(var_1_12); [L36] unsigned char var_1_13 = 1; [L36] unsigned char var_1_13 = 1; [L37] unsigned char* var_1_13_Pointer = &(var_1_13); [L38] unsigned long int var_1_14 = 256; [L38] unsigned long int var_1_14 = 256; [L39] unsigned long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 0; [L40] unsigned char var_1_15 = 0; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char last_1_var_1_11 = 16; [L43] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] EXPR \read(var_1_11) [L95] last_1_var_1_11 = var_1_11 [L96] EXPR \read(var_1_14) [L96] last_1_var_1_14 = var_1_14 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L74] var_1_7 = __VERIFIER_nondet_short() [L75] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] var_1_8 = __VERIFIER_nondet_short() [L78] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] var_1_9 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_9) [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L81] EXPR \read(var_1_9) [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] var_1_10 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] RET updateVariables() [L108] CALL step() [L47] EXPR \read(*var_1_8_Pointer) [L47] signed short int stepLocal_3 = (*(var_1_8_Pointer)); [L48] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=257, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L49] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR \read(*var_1_11_Pointer) [L56] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR (*(var_1_11_Pointer)) & (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR \read(*var_1_12_Pointer) [L56] EXPR \read(*var_1_11_Pointer) [L56] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] COND FALSE !(((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) [L61] EXPR \read(*var_1_7_Pointer) [L61] (*(var_1_14_Pointer)) = (*(var_1_7_Pointer)) [L63] EXPR \read(*var_1_11_Pointer) [L63] unsigned char stepLocal_1 = (*(var_1_11_Pointer)); [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] EXPR (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] unsigned long int stepLocal_0 = (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))); [L65] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L65] COND FALSE !(stepLocal_0 != (*(var_1_11_Pointer))) [L70] (*(var_1_1_Pointer)) = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) [L99] EXPR \read(*var_1_14_Pointer) [L99] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f)) [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR (((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f)) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR ((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR ((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99-L100] return (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.6s, OverallIterations: 36, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8022 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8022 mSDsluCounter, 32437 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25860 mSDsCounter, 374 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10486 IncrementalHoareTripleChecker+Invalid, 10860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 374 mSolverCounterUnsat, 6577 mSDtfsCounter, 10486 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2181 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1497occurred in iteration=15, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 3732 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 4589 NumberOfCodeBlocks, 4589 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4427 ConstructedInterpolants, 0 QuantifiedInterpolants, 14993 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1957 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 10398/10560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:25:49,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.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 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:25:51,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:25:51,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:25:51,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:25:51,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:25:51,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:25:51,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:25:51,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:25:51,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:25:51,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:25:51,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:25:51,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:25:51,502 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:25:51,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:25:51,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:25:51,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:25:51,504 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 -> 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 [2025-03-04 01:25:51,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:25:51,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:25:51,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:25:51,730 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:25:51,730 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:25:51,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2025-03-04 01:25:52,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb13ed0fa/2ed2f10f56f942998992c9850aa7b6b8/FLAGfdb097b45 [2025-03-04 01:25:53,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:25:53,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2025-03-04 01:25:53,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb13ed0fa/2ed2f10f56f942998992c9850aa7b6b8/FLAGfdb097b45 [2025-03-04 01:25:53,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb13ed0fa/2ed2f10f56f942998992c9850aa7b6b8 [2025-03-04 01:25:53,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:25:53,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:25:53,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:25:53,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:25:53,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:25:53,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a58a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53, skipping insertion in model container [2025-03-04 01:25:53,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:25:53,283 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-p_file-18.i[916,929] [2025-03-04 01:25:53,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:25:53,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:25:53,355 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-p_file-18.i[916,929] [2025-03-04 01:25:53,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:25:53,392 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:25:53,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53 WrapperNode [2025-03-04 01:25:53,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:25:53,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:25:53,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:25:53,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:25:53,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,443 INFO L138 Inliner]: procedures = 36, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2025-03-04 01:25:53,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:25:53,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:25:53,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:25:53,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:25:53,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,491 INFO L175 MemorySlicer]: Split 115 memory accesses to 11 slices as follows [2, 5, 14, 8, 12, 12, 26, 12, 8, 10, 6]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1]. [2025-03-04 01:25:53,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:25:53,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:25:53,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:25:53,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:25:53,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (1/1) ... [2025-03-04 01:25:53,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:25:53,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:25:53,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:25:53,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 01:25:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:25:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-04 01:25:53,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:25:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:25:53,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:25:53,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-04 01:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-04 01:25:53,754 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:25:53,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:25:54,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem78#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~ite92#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite88#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite105#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite104#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short115#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~short122#1; [2025-03-04 01:25:54,268 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-04 01:25:54,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:25:54,278 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:25:54,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:25:54,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:25:54 BoogieIcfgContainer [2025-03-04 01:25:54,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:25:54,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:25:54,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:25:54,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:25:54,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:25:53" (1/3) ... [2025-03-04 01:25:54,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8b379e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:25:54, skipping insertion in model container [2025-03-04 01:25:54,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:25:53" (2/3) ... [2025-03-04 01:25:54,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8b379e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:25:54, skipping insertion in model container [2025-03-04 01:25:54,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:25:54" (3/3) ... [2025-03-04 01:25:54,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-18.i [2025-03-04 01:25:54,301 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:25:54,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-18.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:25:54,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:25:54,347 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;@52a6f5f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:25:54,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:25:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:25:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:25:54,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:54,357 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:54,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash 105065811, now seen corresponding path program 1 times [2025-03-04 01:25:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:25:54,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787817624] [2025-03-04 01:25:54,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:54,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:25:54,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:25:54,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:25:54,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:25:54,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:25:54,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:25:54,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:54,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:54,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:25:54,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-04 01:25:54,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:25:54,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:25:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787817624] [2025-03-04 01:25:54,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787817624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:25:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:25:54,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801314345] [2025-03-04 01:25:54,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:54,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:25:54,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:25:54,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:25:54,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:25:54,694 INFO L87 Difference]: Start difference. First operand has 91 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:25:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:54,718 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2025-03-04 01:25:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:25:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-03-04 01:25:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:54,724 INFO L225 Difference]: With dead ends: 176 [2025-03-04 01:25:54,724 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:25:54,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:25:54,729 INFO L435 NwaCegarLoop]: 127 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, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:54,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:25:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:25:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 01:25:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:25:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2025-03-04 01:25:54,779 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 103 [2025-03-04 01:25:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:54,779 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2025-03-04 01:25:54,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:25:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2025-03-04 01:25:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:25:54,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:54,781 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:54,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:25:54,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:25:54,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:54,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1128571817, now seen corresponding path program 1 times [2025-03-04 01:25:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:25:54,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568319004] [2025-03-04 01:25:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:54,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:25:54,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:25:54,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:25:54,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:25:55,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:25:55,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:25:55,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:55,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:55,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:25:55,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:55,518 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 19 [2025-03-04 01:25:55,523 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 13 treesize of output 9 [2025-03-04 01:25:55,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:25:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:25:55,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:25:55,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:25:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568319004] [2025-03-04 01:25:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568319004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:25:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [655921959] [2025-03-04 01:25:55,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:25:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:25:55,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:25:55,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-04 01:25:55,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:25:56,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:25:56,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:56,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:56,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:25:56,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:56,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-04 01:25:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:57,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:25:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [655921959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:57,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:25:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-03-04 01:25:57,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725977760] [2025-03-04 01:25:57,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:57,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:25:57,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:57,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:25:57,004 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:57,172 INFO L93 Difference]: Finished difference Result 260 states and 378 transitions. [2025-03-04 01:25:57,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:25:57,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-04 01:25:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:57,175 INFO L225 Difference]: With dead ends: 260 [2025-03-04 01:25:57,176 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 01:25:57,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:25:57,178 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 72 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:57,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 416 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 01:25:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2025-03-04 01:25:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 143 states have (on average 1.3916083916083917) internal successors, (199), 143 states have internal predecessors, (199), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:25:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 247 transitions. [2025-03-04 01:25:57,197 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 247 transitions. Word has length 103 [2025-03-04 01:25:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:57,199 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 247 transitions. [2025-03-04 01:25:57,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 247 transitions. [2025-03-04 01:25:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:25:57,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:57,200 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:57,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-04 01:25:57,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:25:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:25:57,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1658843670, now seen corresponding path program 1 times [2025-03-04 01:25:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:25:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744353017] [2025-03-04 01:25:57,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:57,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:25:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:25:57,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:25:57,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:25:57,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:25:57,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:25:57,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:57,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:57,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:25:57,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:58,023 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 19 [2025-03-04 01:25:58,027 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 13 treesize of output 9 [2025-03-04 01:25:58,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:25:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:25:58,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:25:58,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:25:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744353017] [2025-03-04 01:25:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744353017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:25:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [64309904] [2025-03-04 01:25:58,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:25:58,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:25:58,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:25:58,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-04 01:25:58,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:25:58,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:25:58,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:25:58,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:25:58,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:25:58,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:25:59,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-04 01:25:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:25:59,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:25:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [64309904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:25:59,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:25:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-04 01:25:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768118571] [2025-03-04 01:25:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:25:59,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:25:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:25:59,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:25:59,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:25:59,282 INFO L87 Difference]: Start difference. First operand 170 states and 247 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:25:59,442 INFO L93 Difference]: Finished difference Result 344 states and 500 transitions. [2025-03-04 01:25:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:25:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-04 01:25:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:25:59,444 INFO L225 Difference]: With dead ends: 344 [2025-03-04 01:25:59,444 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 01:25:59,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:25:59,445 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 71 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:25:59,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 411 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:25:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 01:25:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2025-03-04 01:25:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:25:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 249 transitions. [2025-03-04 01:25:59,454 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 249 transitions. Word has length 103 [2025-03-04 01:25:59,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:25:59,455 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 249 transitions. [2025-03-04 01:25:59,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:25:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 249 transitions. [2025-03-04 01:25:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:25:59,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:25:59,456 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:25:59,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:25:59,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-04 01:25:59,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:25:59,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:25:59,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:25:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 839172267, now seen corresponding path program 1 times [2025-03-04 01:25:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:25:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739091401] [2025-03-04 01:25:59,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:25:59,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:25:59,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:25:59,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:25:59,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:25:59,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:26:00,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:26:00,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:00,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:00,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:26:00,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:00,246 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 19 [2025-03-04 01:26:00,249 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 13 treesize of output 9 [2025-03-04 01:26:00,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:00,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:00,432 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:00,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739091401] [2025-03-04 01:26:00,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739091401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:00,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [357928884] [2025-03-04 01:26:00,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:00,433 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:00,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:26:00,436 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:26:00,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-04 01:26:00,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:26:00,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:26:00,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:00,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:00,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:26:00,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:01,540 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 33 treesize of output 21 [2025-03-04 01:26:01,604 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 35 treesize of output 19 [2025-03-04 01:26:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:01,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [357928884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:01,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:01,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2025-03-04 01:26:01,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293629158] [2025-03-04 01:26:01,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:26:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:01,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:26:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:26:01,644 INFO L87 Difference]: Start difference. First operand 172 states and 249 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:02,795 INFO L93 Difference]: Finished difference Result 433 states and 627 transitions. [2025-03-04 01:26:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:26:02,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-04 01:26:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:02,798 INFO L225 Difference]: With dead ends: 433 [2025-03-04 01:26:02,798 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:26:02,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:26:02,799 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 188 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:02,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1452 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:26:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:26:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 252. [2025-03-04 01:26:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 212 states have (on average 1.3820754716981132) internal successors, (293), 212 states have internal predecessors, (293), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:26:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 365 transitions. [2025-03-04 01:26:02,829 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 365 transitions. Word has length 103 [2025-03-04 01:26:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:02,829 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 365 transitions. [2025-03-04 01:26:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 365 transitions. [2025-03-04 01:26:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:26:02,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:02,834 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:02,843 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-04 01:26:03,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:26:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:03,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1505681128, now seen corresponding path program 1 times [2025-03-04 01:26:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356257296] [2025-03-04 01:26:03,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:03,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:03,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:03,238 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:03,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:26:03,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:26:03,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:26:03,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:03,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:03,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:26:03,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:03,569 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 19 [2025-03-04 01:26:03,571 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 13 treesize of output 9 [2025-03-04 01:26:03,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:03,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:03,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356257296] [2025-03-04 01:26:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356257296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [620154511] [2025-03-04 01:26:03,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:03,688 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:03,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:26:03,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:26:03,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:26:03,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:26:04,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:26:04,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:04,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:04,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 01:26:04,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:04,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:26:04,591 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-04 01:26:04,593 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-04 01:26:04,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:04,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [620154511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:04,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:26:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-04 01:26:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104222699] [2025-03-04 01:26:04,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:26:04,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:26:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:04,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:26:04,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:26:04,640 INFO L87 Difference]: Start difference. First operand 252 states and 365 transitions. Second operand has 15 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:05,548 INFO L93 Difference]: Finished difference Result 784 states and 1117 transitions. [2025-03-04 01:26:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:26:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 104 [2025-03-04 01:26:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:05,553 INFO L225 Difference]: With dead ends: 784 [2025-03-04 01:26:05,553 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 01:26:05,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:26:05,555 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 376 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:05,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 778 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:26:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 01:26:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 521. [2025-03-04 01:26:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 436 states have (on average 1.3669724770642202) internal successors, (596), 436 states have internal predecessors, (596), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-04 01:26:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 740 transitions. [2025-03-04 01:26:05,602 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 740 transitions. Word has length 104 [2025-03-04 01:26:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:05,602 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 740 transitions. [2025-03-04 01:26:05,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 740 transitions. [2025-03-04 01:26:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:26:05,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:05,604 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:05,612 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 (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:26:05,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:26:06,005 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:06,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:06,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1281734359, now seen corresponding path program 1 times [2025-03-04 01:26:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:06,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715739963] [2025-03-04 01:26:06,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:06,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:06,009 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:06,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:26:06,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:26:06,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:26:06,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:06,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:06,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:26:06,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:06,345 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 19 [2025-03-04 01:26:06,348 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 13 treesize of output 9 [2025-03-04 01:26:06,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:06,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:06,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715739963] [2025-03-04 01:26:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715739963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [882955786] [2025-03-04 01:26:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:06,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:26:06,499 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:26:06,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:26:06,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:26:06,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:26:06,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:06,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:06,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:26:06,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:06,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:26:07,422 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-04 01:26:07,424 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-04 01:26:07,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:07,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [882955786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:07,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:26:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-04 01:26:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019533694] [2025-03-04 01:26:07,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:26:07,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:26:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:07,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:26:07,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:26:07,505 INFO L87 Difference]: Start difference. First operand 521 states and 740 transitions. Second operand has 16 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:08,656 INFO L93 Difference]: Finished difference Result 708 states and 999 transitions. [2025-03-04 01:26:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 01:26:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 104 [2025-03-04 01:26:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:08,659 INFO L225 Difference]: With dead ends: 708 [2025-03-04 01:26:08,659 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 01:26:08,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=1186, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 01:26:08,661 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 521 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:08,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1170 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:26:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 01:26:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 437. [2025-03-04 01:26:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 366 states have (on average 1.3633879781420766) internal successors, (499), 366 states have internal predecessors, (499), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:26:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 619 transitions. [2025-03-04 01:26:08,686 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 619 transitions. Word has length 104 [2025-03-04 01:26:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:08,686 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 619 transitions. [2025-03-04 01:26:08,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 619 transitions. [2025-03-04 01:26:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:26:08,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:08,688 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:08,696 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-04 01:26:08,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-04 01:26:09,089 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:09,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:09,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1295351998, now seen corresponding path program 1 times [2025-03-04 01:26:09,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:09,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630664075] [2025-03-04 01:26:09,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:09,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:09,092 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-04 01:26:09,092 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-04 01:26:09,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:26:09,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:26:09,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:09,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:09,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:26:09,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:09,708 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 19 [2025-03-04 01:26:09,711 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 13 treesize of output 9 [2025-03-04 01:26:09,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:09,937 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 25 treesize of output 13 [2025-03-04 01:26:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:09,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:10,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630664075] [2025-03-04 01:26:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630664075] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:10,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:10,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2025-03-04 01:26:10,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203606541] [2025-03-04 01:26:10,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:10,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:26:10,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:10,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:26:10,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:26:10,158 INFO L87 Difference]: Start difference. First operand 437 states and 619 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:10,614 INFO L93 Difference]: Finished difference Result 941 states and 1335 transitions. [2025-03-04 01:26:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:26:10,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-04 01:26:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:10,617 INFO L225 Difference]: With dead ends: 941 [2025-03-04 01:26:10,617 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 01:26:10,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:26:10,620 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 655 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:10,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 355 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:26:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 01:26:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 437. [2025-03-04 01:26:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 366 states have (on average 1.3579234972677596) internal successors, (497), 366 states have internal predecessors, (497), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:26:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 617 transitions. [2025-03-04 01:26:10,649 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 617 transitions. Word has length 104 [2025-03-04 01:26:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:10,650 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 617 transitions. [2025-03-04 01:26:10,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 617 transitions. [2025-03-04 01:26:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:26:10,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:10,651 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:10,659 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-04 01:26:10,856 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-04 01:26:10,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1897790110, now seen corresponding path program 1 times [2025-03-04 01:26:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:10,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513412930] [2025-03-04 01:26:10,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:10,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:10,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:10,858 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-04 01:26:10,865 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-04 01:26:10,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:26:11,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:26:11,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:11,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:11,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:26:11,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:11,186 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 19 [2025-03-04 01:26:11,188 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 13 treesize of output 9 [2025-03-04 01:26:11,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:11,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:11,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513412930] [2025-03-04 01:26:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513412930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1220447253] [2025-03-04 01:26:11,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:11,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:26:11,323 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:26:11,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-04 01:26:11,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:26:11,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:26:11,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:11,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:11,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 01:26:11,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:11,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:26:12,221 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-04 01:26:12,223 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-04 01:26:12,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:12,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1220447253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:12,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:26:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-04 01:26:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192338634] [2025-03-04 01:26:12,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:26:12,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:26:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:12,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:26:12,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:26:12,288 INFO L87 Difference]: Start difference. First operand 437 states and 617 transitions. Second operand has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:13,266 INFO L93 Difference]: Finished difference Result 622 states and 870 transitions. [2025-03-04 01:26:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:26:13,266 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 105 [2025-03-04 01:26:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:13,268 INFO L225 Difference]: With dead ends: 622 [2025-03-04 01:26:13,268 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 01:26:13,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:26:13,269 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 421 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:13,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1198 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:26:13,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 01:26:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 351. [2025-03-04 01:26:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 294 states have (on average 1.3571428571428572) internal successors, (399), 294 states have internal predecessors, (399), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:26:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 495 transitions. [2025-03-04 01:26:13,293 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 495 transitions. Word has length 105 [2025-03-04 01:26:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:13,293 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 495 transitions. [2025-03-04 01:26:13,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 495 transitions. [2025-03-04 01:26:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:26:13,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:13,294 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:13,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2025-03-04 01:26:13,501 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-04 01:26:13,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-04 01:26:13,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:13,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:13,695 INFO L85 PathProgramCache]: Analyzing trace with hash -320970170, now seen corresponding path program 1 times [2025-03-04 01:26:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369283779] [2025-03-04 01:26:13,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:13,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:13,697 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-04 01:26:13,699 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-04 01:26:13,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:26:13,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:26:13,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:13,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:13,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:26:13,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:14,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:14,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369283779] [2025-03-04 01:26:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369283779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:14,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:26:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270743004] [2025-03-04 01:26:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:14,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:26:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:14,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:26:14,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:26:14,013 INFO L87 Difference]: Start difference. First operand 351 states and 495 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:14,122 INFO L93 Difference]: Finished difference Result 699 states and 986 transitions. [2025-03-04 01:26:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:26:14,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-04 01:26:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:14,126 INFO L225 Difference]: With dead ends: 699 [2025-03-04 01:26:14,127 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 01:26:14,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:26:14,128 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:14,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 377 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:26:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 01:26:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 265. [2025-03-04 01:26:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 222 states have (on average 1.3513513513513513) internal successors, (300), 222 states have internal predecessors, (300), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:26:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 372 transitions. [2025-03-04 01:26:14,148 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 372 transitions. Word has length 106 [2025-03-04 01:26:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:14,148 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 372 transitions. [2025-03-04 01:26:14,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 372 transitions. [2025-03-04 01:26:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:26:14,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:14,149 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:14,158 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-04 01:26:14,349 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-04 01:26:14,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:14,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1186581639, now seen corresponding path program 1 times [2025-03-04 01:26:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044037414] [2025-03-04 01:26:14,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:14,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:14,352 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-04 01:26:14,353 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-04 01:26:14,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:26:14,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:26:14,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:14,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:14,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:26:14,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:14,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:14,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044037414] [2025-03-04 01:26:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044037414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:14,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:14,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:26:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367781131] [2025-03-04 01:26:14,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:14,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:26:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:14,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:26:14,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:26:14,662 INFO L87 Difference]: Start difference. First operand 265 states and 372 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:14,789 INFO L93 Difference]: Finished difference Result 529 states and 742 transitions. [2025-03-04 01:26:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:26:14,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-04 01:26:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:14,791 INFO L225 Difference]: With dead ends: 529 [2025-03-04 01:26:14,791 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 01:26:14,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:26:14,792 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 65 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:14,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 589 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:26:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 01:26:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2025-03-04 01:26:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 222 states have internal predecessors, (298), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:26:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 370 transitions. [2025-03-04 01:26:14,806 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 370 transitions. Word has length 106 [2025-03-04 01:26:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:14,806 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 370 transitions. [2025-03-04 01:26:14,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 370 transitions. [2025-03-04 01:26:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:26:14,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:14,807 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:14,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-03-04 01:26:15,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:15,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:15,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1878208616, now seen corresponding path program 1 times [2025-03-04 01:26:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:15,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536189137] [2025-03-04 01:26:15,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:15,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:15,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:15,022 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:15,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-03-04 01:26:15,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:26:15,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:26:15,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:15,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:15,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:26:15,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:15,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:15,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536189137] [2025-03-04 01:26:15,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536189137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:15,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:15,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:26:15,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059927882] [2025-03-04 01:26:15,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:15,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:26:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:15,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:26:15,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:26:15,249 INFO L87 Difference]: Start difference. First operand 265 states and 370 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:15,283 INFO L93 Difference]: Finished difference Result 536 states and 749 transitions. [2025-03-04 01:26:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:26:15,283 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-04 01:26:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:15,285 INFO L225 Difference]: With dead ends: 536 [2025-03-04 01:26:15,285 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 01:26:15,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-04 01:26:15,286 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:15,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 01:26:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-04 01:26:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 231 states have (on average 1.329004329004329) internal successors, (307), 231 states have internal predecessors, (307), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:26:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 379 transitions. [2025-03-04 01:26:15,303 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 379 transitions. Word has length 106 [2025-03-04 01:26:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:15,303 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 379 transitions. [2025-03-04 01:26:15,304 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 379 transitions. [2025-03-04 01:26:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:26:15,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:15,306 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:15,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-03-04 01:26:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:15,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:15,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1106174720, now seen corresponding path program 1 times [2025-03-04 01:26:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665797990] [2025-03-04 01:26:15,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:15,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:15,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:15,509 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:15,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-03-04 01:26:15,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:26:15,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:26:15,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:15,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:15,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:26:15,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:15,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:15,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665797990] [2025-03-04 01:26:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665797990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:26:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153854515] [2025-03-04 01:26:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:15,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:26:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:15,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:26:15,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:26:15,852 INFO L87 Difference]: Start difference. First operand 274 states and 379 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:15,994 INFO L93 Difference]: Finished difference Result 545 states and 753 transitions. [2025-03-04 01:26:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:26:15,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-04 01:26:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:15,996 INFO L225 Difference]: With dead ends: 545 [2025-03-04 01:26:15,996 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 01:26:15,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:26:15,997 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 59 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:15,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 429 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:26:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 01:26:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 95. [2025-03-04 01:26:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:26:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2025-03-04 01:26:16,007 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 107 [2025-03-04 01:26:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:16,007 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2025-03-04 01:26:16,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2025-03-04 01:26:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:26:16,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:16,009 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:16,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-03-04 01:26:16,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:16,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:16,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1612873306, now seen corresponding path program 1 times [2025-03-04 01:26:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275653250] [2025-03-04 01:26:16,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:16,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:16,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:16,212 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:16,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-03-04 01:26:16,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:26:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:26:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:16,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:16,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:26:16,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:16,723 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 53 treesize of output 33 [2025-03-04 01:26:16,729 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 26 treesize of output 18 [2025-03-04 01:26:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:16,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:16,756 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275653250] [2025-03-04 01:26:16,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275653250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:16,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:16,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:26:16,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039190285] [2025-03-04 01:26:16,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:16,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:26:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:16,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:26:16,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:26:16,757 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:17,224 INFO L93 Difference]: Finished difference Result 308 states and 418 transitions. [2025-03-04 01:26:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:26:17,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-04 01:26:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:17,226 INFO L225 Difference]: With dead ends: 308 [2025-03-04 01:26:17,226 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 01:26:17,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:26:17,227 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 186 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:17,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 556 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:26:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 01:26:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 187. [2025-03-04 01:26:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.3037974683544304) internal successors, (206), 158 states have internal predecessors, (206), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:26:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 254 transitions. [2025-03-04 01:26:17,244 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 254 transitions. Word has length 108 [2025-03-04 01:26:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:17,244 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 254 transitions. [2025-03-04 01:26:17,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 254 transitions. [2025-03-04 01:26:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:26:17,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:17,245 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:17,252 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 (20)] Ended with exit code 0 [2025-03-04 01:26:17,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:17,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1342748623, now seen corresponding path program 1 times [2025-03-04 01:26:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038543274] [2025-03-04 01:26:17,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:17,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:17,448 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:17,449 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 (21)] Waiting until timeout for monitored process [2025-03-04 01:26:17,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:26:17,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:26:17,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:17,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:17,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:26:17,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:17,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:17,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038543274] [2025-03-04 01:26:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038543274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:17,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:17,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:26:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383046959] [2025-03-04 01:26:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:26:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:17,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:26:17,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:26:17,689 INFO L87 Difference]: Start difference. First operand 187 states and 254 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:17,726 INFO L93 Difference]: Finished difference Result 377 states and 513 transitions. [2025-03-04 01:26:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:26:17,726 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-04 01:26:17,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:17,727 INFO L225 Difference]: With dead ends: 377 [2025-03-04 01:26:17,727 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 01:26:17,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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-04 01:26:17,728 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:17,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 01:26:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 01:26:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 164 states have internal predecessors, (212), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:26:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 260 transitions. [2025-03-04 01:26:17,745 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 260 transitions. Word has length 108 [2025-03-04 01:26:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:17,746 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 260 transitions. [2025-03-04 01:26:17,746 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 260 transitions. [2025-03-04 01:26:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:26:17,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:17,747 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:17,754 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 (21)] Ended with exit code 0 [2025-03-04 01:26:17,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:17,947 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:17,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1599500923, now seen corresponding path program 1 times [2025-03-04 01:26:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:17,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827638056] [2025-03-04 01:26:17,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:17,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:17,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:17,950 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:17,951 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 (22)] Waiting until timeout for monitored process [2025-03-04 01:26:18,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:26:18,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:26:18,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:18,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:18,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:26:18,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:18,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2025-03-04 01:26:18,262 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 25 treesize of output 17 [2025-03-04 01:26:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:18,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:18,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:18,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827638056] [2025-03-04 01:26:18,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827638056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:18,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:18,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:26:18,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661325042] [2025-03-04 01:26:18,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:18,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:26:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:18,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:26:18,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:26:18,297 INFO L87 Difference]: Start difference. First operand 193 states and 260 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:18,677 INFO L93 Difference]: Finished difference Result 345 states and 462 transitions. [2025-03-04 01:26:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:26:18,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-04 01:26:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:18,679 INFO L225 Difference]: With dead ends: 345 [2025-03-04 01:26:18,679 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 01:26:18,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:26:18,680 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 181 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:18,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:26:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 01:26:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 103. [2025-03-04 01:26:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:26:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2025-03-04 01:26:18,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 109 [2025-03-04 01:26:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:18,696 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2025-03-04 01:26:18,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2025-03-04 01:26:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:26:18,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:18,697 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:18,704 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 (22)] Ended with exit code 0 [2025-03-04 01:26:18,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:18,898 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:18,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1254210488, now seen corresponding path program 1 times [2025-03-04 01:26:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928949935] [2025-03-04 01:26:18,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:18,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:18,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:18,900 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:18,901 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 (23)] Waiting until timeout for monitored process [2025-03-04 01:26:19,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:26:19,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:26:19,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:19,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:19,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:26:19,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:19,489 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 33 treesize of output 17 [2025-03-04 01:26:19,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:26:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:26:19,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:19,760 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:26:19,761 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 31 treesize of output 30 [2025-03-04 01:26:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:26:19,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928949935] [2025-03-04 01:26:19,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928949935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:26:19,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:26:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-04 01:26:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560062795] [2025-03-04 01:26:19,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:26:19,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:26:19,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:19,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:26:19,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:26:19,823 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 states have internal predecessors, (94), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:21,776 INFO L93 Difference]: Finished difference Result 339 states and 451 transitions. [2025-03-04 01:26:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:26:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 states have internal predecessors, (94), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 110 [2025-03-04 01:26:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:21,778 INFO L225 Difference]: With dead ends: 339 [2025-03-04 01:26:21,778 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 01:26:21,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:26:21,779 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 480 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:21,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 749 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:26:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 01:26:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 198. [2025-03-04 01:26:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 169 states have internal predecessors, (217), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:26:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 265 transitions. [2025-03-04 01:26:21,797 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 265 transitions. Word has length 110 [2025-03-04 01:26:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:21,798 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 265 transitions. [2025-03-04 01:26:21,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 states have internal predecessors, (94), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:26:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 265 transitions. [2025-03-04 01:26:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:26:21,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:21,799 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:21,807 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 (23)] Forceful destruction successful, exit code 0 [2025-03-04 01:26:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:21,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:22,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1125698581, now seen corresponding path program 1 times [2025-03-04 01:26:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:22,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170081992] [2025-03-04 01:26:22,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:22,003 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:22,004 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 (24)] Waiting until timeout for monitored process [2025-03-04 01:26:22,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:26:22,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:26:22,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:22,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:22,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:26:22,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:23,004 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 37 treesize of output 21 [2025-03-04 01:26:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 14 proven. 132 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-04 01:26:23,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:23,162 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:23,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170081992] [2025-03-04 01:26:23,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170081992] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:23,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:23,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-04 01:26:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147318710] [2025-03-04 01:26:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:23,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:26:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:23,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:26:23,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:26:23,163 INFO L87 Difference]: Start difference. First operand 198 states and 265 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:23,519 INFO L93 Difference]: Finished difference Result 420 states and 558 transitions. [2025-03-04 01:26:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:26:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-04 01:26:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:23,521 INFO L225 Difference]: With dead ends: 420 [2025-03-04 01:26:23,521 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 01:26:23,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:26:23,522 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 48 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:23,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 328 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:26:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 01:26:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 209. [2025-03-04 01:26:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 180 states have (on average 1.261111111111111) internal successors, (227), 180 states have internal predecessors, (227), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:26:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 275 transitions. [2025-03-04 01:26:23,540 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 275 transitions. Word has length 110 [2025-03-04 01:26:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 275 transitions. [2025-03-04 01:26:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 275 transitions. [2025-03-04 01:26:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:26:23,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:23,541 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:23,549 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 (24)] Ended with exit code 0 [2025-03-04 01:26:23,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:23,742 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:23,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1236613703, now seen corresponding path program 1 times [2025-03-04 01:26:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925599446] [2025-03-04 01:26:23,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:23,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:23,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:23,744 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:23,745 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 (25)] Waiting until timeout for monitored process [2025-03-04 01:26:23,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:26:24,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:26:24,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:24,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:24,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:26:24,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:24,064 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-04 01:26:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:24,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:24,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925599446] [2025-03-04 01:26:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925599446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:24,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:24,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:26:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598203434] [2025-03-04 01:26:24,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:24,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:26:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:24,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:26:24,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:26:24,122 INFO L87 Difference]: Start difference. First operand 209 states and 275 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:24,435 INFO L93 Difference]: Finished difference Result 315 states and 398 transitions. [2025-03-04 01:26:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:26:24,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-04 01:26:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:24,437 INFO L225 Difference]: With dead ends: 315 [2025-03-04 01:26:24,437 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 01:26:24,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:26:24,438 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:24,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 591 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:26:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 01:26:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 291. [2025-03-04 01:26:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 262 states have (on average 1.2213740458015268) internal successors, (320), 262 states have internal predecessors, (320), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:26:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 368 transitions. [2025-03-04 01:26:24,456 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 368 transitions. Word has length 110 [2025-03-04 01:26:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:24,457 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 368 transitions. [2025-03-04 01:26:24,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 368 transitions. [2025-03-04 01:26:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:26:24,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:24,458 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:24,466 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 (25)] Forceful destruction successful, exit code 0 [2025-03-04 01:26:24,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:24,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:24,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1159740406, now seen corresponding path program 1 times [2025-03-04 01:26:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:24,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868235589] [2025-03-04 01:26:24,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:24,665 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:24,666 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 (26)] Waiting until timeout for monitored process [2025-03-04 01:26:24,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:26:24,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:26:24,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:24,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:24,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:26:24,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:24,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:26,088 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 36 treesize of output 20 [2025-03-04 01:26:26,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:26:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 16 proven. 135 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 01:26:26,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:27,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:26:27,004 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 51 treesize of output 46 [2025-03-04 01:26:27,307 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868235589] [2025-03-04 01:26:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868235589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1321100709] [2025-03-04 01:26:27,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:27,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:27,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:26:27,309 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:26:27,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2025-03-04 01:26:27,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:26:27,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:26:27,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:27,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:27,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:26:27,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:27,903 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-04 01:26:28,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2025-03-04 01:26:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:28,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:28,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1321100709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:28,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:28,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2025-03-04 01:26:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372012375] [2025-03-04 01:26:28,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:28,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:26:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:28,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:26:28,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:26:28,197 INFO L87 Difference]: Start difference. First operand 291 states and 368 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:28,502 INFO L93 Difference]: Finished difference Result 610 states and 774 transitions. [2025-03-04 01:26:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:26:28,503 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-04 01:26:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:28,504 INFO L225 Difference]: With dead ends: 610 [2025-03-04 01:26:28,504 INFO L226 Difference]: Without dead ends: 437 [2025-03-04 01:26:28,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=232, Invalid=1408, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 01:26:28,505 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 82 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:28,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1036 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:26:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-04 01:26:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 428. [2025-03-04 01:26:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 391 states have (on average 1.237851662404092) internal successors, (484), 392 states have internal predecessors, (484), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:26:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 544 transitions. [2025-03-04 01:26:28,533 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 544 transitions. Word has length 111 [2025-03-04 01:26:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:28,533 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 544 transitions. [2025-03-04 01:26:28,533 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 544 transitions. [2025-03-04 01:26:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:26:28,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:28,534 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:28,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2025-03-04 01:26:28,742 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 (26)] Ended with exit code 0 [2025-03-04 01:26:28,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:28,935 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:28,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2005449367, now seen corresponding path program 1 times [2025-03-04 01:26:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:28,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278066967] [2025-03-04 01:26:28,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:28,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:28,937 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:28,938 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 (28)] Waiting until timeout for monitored process [2025-03-04 01:26:29,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:26:29,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:26:29,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:29,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:29,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 01:26:29,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:29,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2025-03-04 01:26:29,800 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 38 treesize of output 30 [2025-03-04 01:26:29,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-03-04 01:26:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:29,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:29,846 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278066967] [2025-03-04 01:26:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278066967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:29,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:29,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:26:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281700882] [2025-03-04 01:26:29,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:26:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:29,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:26:29,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:26:29,846 INFO L87 Difference]: Start difference. First operand 428 states and 544 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:30,664 INFO L93 Difference]: Finished difference Result 998 states and 1261 transitions. [2025-03-04 01:26:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:26:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-03-04 01:26:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:30,668 INFO L225 Difference]: With dead ends: 998 [2025-03-04 01:26:30,668 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 01:26:30,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:26:30,669 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 152 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:30,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 587 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:26:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 01:26:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 522. [2025-03-04 01:26:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 471 states have (on average 1.2250530785562632) internal successors, (577), 472 states have internal predecessors, (577), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:26:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 661 transitions. [2025-03-04 01:26:30,715 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 661 transitions. Word has length 112 [2025-03-04 01:26:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:30,715 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 661 transitions. [2025-03-04 01:26:30,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 661 transitions. [2025-03-04 01:26:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:26:30,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:30,716 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:30,725 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 (28)] Ended with exit code 0 [2025-03-04 01:26:30,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:30,917 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1477814824, now seen corresponding path program 1 times [2025-03-04 01:26:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:30,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901689658] [2025-03-04 01:26:30,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:30,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:30,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:30,919 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:30,920 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 (29)] Waiting until timeout for monitored process [2025-03-04 01:26:31,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:26:31,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:26:31,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:31,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:31,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 01:26:31,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:31,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:32,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:26:32,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:26:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 16 proven. 135 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 01:26:32,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:33,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:26:33,500 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 51 treesize of output 46 [2025-03-04 01:26:33,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901689658] [2025-03-04 01:26:33,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901689658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [928443860] [2025-03-04 01:26:33,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:33,830 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:33,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:26:33,832 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:26:33,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2025-03-04 01:26:34,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:26:34,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:26:34,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:34,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:34,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 01:26:34,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:34,486 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-04 01:26:34,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2025-03-04 01:26:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:26:34,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [928443860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:34,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:34,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 28 [2025-03-04 01:26:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679451214] [2025-03-04 01:26:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:26:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:34,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:26:34,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1316, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 01:26:34,789 INFO L87 Difference]: Start difference. First operand 522 states and 661 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:35,164 INFO L93 Difference]: Finished difference Result 966 states and 1228 transitions. [2025-03-04 01:26:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:26:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-04 01:26:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:35,166 INFO L225 Difference]: With dead ends: 966 [2025-03-04 01:26:35,166 INFO L226 Difference]: Without dead ends: 670 [2025-03-04 01:26:35,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=260, Invalid=1632, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 01:26:35,167 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 82 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:35,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1189 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:26:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-04 01:26:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 524. [2025-03-04 01:26:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 473 states have (on average 1.2241014799154335) internal successors, (579), 474 states have internal predecessors, (579), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:26:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 663 transitions. [2025-03-04 01:26:35,202 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 663 transitions. Word has length 113 [2025-03-04 01:26:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:35,203 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 663 transitions. [2025-03-04 01:26:35,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:26:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 663 transitions. [2025-03-04 01:26:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:26:35,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:35,204 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:35,211 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 (29)] Forceful destruction successful, exit code 0 [2025-03-04 01:26:35,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2025-03-04 01:26:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:35,604 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash -516200807, now seen corresponding path program 1 times [2025-03-04 01:26:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451772244] [2025-03-04 01:26:35,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:35,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:35,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:35,607 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:35,607 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 (31)] Waiting until timeout for monitored process [2025-03-04 01:26:35,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:26:35,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:26:35,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:35,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:35,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 01:26:35,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:35,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:26:37,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:26:37,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:26:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 16 proven. 135 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 01:26:37,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:38,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:26:38,228 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 51 treesize of output 46 [2025-03-04 01:26:38,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451772244] [2025-03-04 01:26:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451772244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [765716685] [2025-03-04 01:26:38,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:38,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:26:38,512 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:26:38,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2025-03-04 01:26:38,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:26:39,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:26:39,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:39,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:39,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:26:39,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:39,270 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