./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:45:23,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:45:23,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:45:23,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:45:23,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:45:23,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:45:23,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:45:23,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:45:23,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:45:23,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:45:23,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:45:23,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:45:23,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:45:23,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:45:23,516 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:45:23,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:45:23,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:45:23,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:45:23,517 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:45:23,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:45:23,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:45:23,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:45:23,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:45:23,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:45:23,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:45:23,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:45:23,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:45:23,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:45:23,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:45:23,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:45:23,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:45:23,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:45:23,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:45:23,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:45:23,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:45:23,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:45:23,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:45:23,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:45:23,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:45:23,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:45:23,520 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-jdk21/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 -> 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e [2025-01-09 15:45:23,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:45:23,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:45:23,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:45:23,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:45:23,768 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:45:23,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i [2025-01-09 15:45:25,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caa98cdb4/9fe4654bdc1a409b9fbc01eaf367a64d/FLAG4180ec60f [2025-01-09 15:45:25,424 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:45:25,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i [2025-01-09 15:45:25,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caa98cdb4/9fe4654bdc1a409b9fbc01eaf367a64d/FLAG4180ec60f [2025-01-09 15:45:25,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caa98cdb4/9fe4654bdc1a409b9fbc01eaf367a64d [2025-01-09 15:45:25,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:45:25,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:45:25,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:45:25,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:45:25,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:45:25,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f54ecb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25, skipping insertion in model container [2025-01-09 15:45:25,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:45:25,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i[916,929] [2025-01-09 15:45:25,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:45:25,674 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:45:25,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i[916,929] [2025-01-09 15:45:25,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:45:25,730 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:45:25,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25 WrapperNode [2025-01-09 15:45:25,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:45:25,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:45:25,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:45:25,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:45:25,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,785 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2025-01-09 15:45:25,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:45:25,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:45:25,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:45:25,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:45:25,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,824 INFO L175 MemorySlicer]: Split 124 memory accesses to 13 slices as follows [2, 7, 18, 20, 8, 8, 12, 12, 8, 6, 7, 10, 6]. 16 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1]. [2025-01-09 15:45:25,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:45:25,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:45:25,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:45:25,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:45:25,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (1/1) ... [2025-01-09 15:45:25,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:45:25,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:45:25,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:45:25,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:45:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:45:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:45:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:45:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:45:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:45:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:45:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:45:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:45:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:45:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:45:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:45:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:45:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:45:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:45:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:45:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:45:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:45:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:45:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:45:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:45:25,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:45:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:45:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:45:25,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:45:26,042 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:45:26,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:45:26,502 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 15:45:26,502 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:45:26,512 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:45:26,512 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:45:26,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:26 BoogieIcfgContainer [2025-01-09 15:45:26,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:45:26,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:45:26,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:45:26,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:45:26,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:45:25" (1/3) ... [2025-01-09 15:45:26,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dc90ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:26, skipping insertion in model container [2025-01-09 15:45:26,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:25" (2/3) ... [2025-01-09 15:45:26,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dc90ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:26, skipping insertion in model container [2025-01-09 15:45:26,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:26" (3/3) ... [2025-01-09 15:45:26,521 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-32.i [2025-01-09 15:45:26,532 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:45:26,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:45:26,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:45:26,594 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;@11e83cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:45:26,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:45:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:45:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:45:26,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:45:26,607 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:45:26,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:45:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:45:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1508954662, now seen corresponding path program 1 times [2025-01-09 15:45:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:45:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037931707] [2025-01-09 15:45:26,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:45:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:45:26,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:45:26,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:45:26,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:45:26,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:45:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:45:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:45:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037931707] [2025-01-09 15:45:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037931707] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:45:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463521024] [2025-01-09 15:45:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:45:26,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:45:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:45:26,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:45:26,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:45:26,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:45:27,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:45:27,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:45:27,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:45:27,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:45:27,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:45:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:45:27,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:45:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463521024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:45:27,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:45:27,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:45:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231957546] [2025-01-09 15:45:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:45:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:45:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:45:27,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:45:27,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:45:27,100 INFO L87 Difference]: Start difference. First operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:45:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:45:27,128 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-01-09 15:45:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:45:27,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-01-09 15:45:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:45:27,134 INFO L225 Difference]: With dead ends: 190 [2025-01-09 15:45:27,134 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 15:45:27,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:45:27,138 INFO L435 NwaCegarLoop]: 132 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, 132 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-01-09 15:45:27,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:45:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 15:45:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 15:45:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:45:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-01-09 15:45:27,164 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-01-09 15:45:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:45:27,164 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-01-09 15:45:27,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:45:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-01-09 15:45:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:45:27,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:45:27,170 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:45:27,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:45:27,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:45:27,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:45:27,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:45:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1735291062, now seen corresponding path program 1 times [2025-01-09 15:45:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:45:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162828078] [2025-01-09 15:45:27,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:45:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:45:27,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:45:27,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:45:27,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:45:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:45:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:45:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:45:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162828078] [2025-01-09 15:45:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162828078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:45:27,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:45:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:45:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567673164] [2025-01-09 15:45:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:45:27,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:45:27,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:45:27,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:45:27,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:45:27,791 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:45:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:45:27,900 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-01-09 15:45:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:45:27,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-01-09 15:45:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:45:27,906 INFO L225 Difference]: With dead ends: 318 [2025-01-09 15:45:27,906 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 15:45:27,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:45:27,907 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 213 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:45:27,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 368 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:45:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 15:45:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 193. [2025-01-09 15:45:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:45:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-01-09 15:45:27,947 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 129 [2025-01-09 15:45:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:45:27,947 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-01-09 15:45:27,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:45:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-01-09 15:45:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 15:45:27,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:45:27,949 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:45:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:45:27,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:45:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:45:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1290295248, now seen corresponding path program 1 times [2025-01-09 15:45:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:45:27,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077920711] [2025-01-09 15:45:27,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:45:27,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:45:27,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 15:45:28,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 15:45:28,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:45:28,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:45:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:45:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:45:28,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077920711] [2025-01-09 15:45:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077920711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:45:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:45:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:45:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028860695] [2025-01-09 15:45:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:45:28,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:45:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:45:28,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:45:28,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:45:28,824 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:45:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:45:29,075 INFO L93 Difference]: Finished difference Result 511 states and 714 transitions. [2025-01-09 15:45:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:45:29,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-01-09 15:45:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:45:29,078 INFO L225 Difference]: With dead ends: 511 [2025-01-09 15:45:29,078 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 15:45:29,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:45:29,082 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 80 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:45:29,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1088 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:45:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 15:45:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2025-01-09 15:45:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 270 states have internal predecessors, (353), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:45:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 441 transitions. [2025-01-09 15:45:29,127 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 441 transitions. Word has length 137 [2025-01-09 15:45:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:45:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 441 transitions. [2025-01-09 15:45:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:45:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 441 transitions. [2025-01-09 15:45:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:45:29,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:45:29,130 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:45:29,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:45:29,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:45:29,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:45:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1620787401, now seen corresponding path program 1 times [2025-01-09 15:45:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:45:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90528567] [2025-01-09 15:45:29,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:45:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:45:29,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:45:29,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:45:29,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:45:29,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:45:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:45:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:45:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90528567] [2025-01-09 15:45:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90528567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:45:42,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:45:42,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-01-09 15:45:42,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618868186] [2025-01-09 15:45:42,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:45:42,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 15:45:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:45:42,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 15:45:42,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=556, Unknown=1, NotChecked=0, Total=650 [2025-01-09 15:45:42,720 INFO L87 Difference]: Start difference. First operand 317 states and 441 transitions. Second operand has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-01-09 15:45:48,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:45:52,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:46:19,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:46:34,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:46:38,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:46:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:38,455 INFO L93 Difference]: Finished difference Result 673 states and 931 transitions. [2025-01-09 15:46:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 15:46:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) Word has length 139 [2025-01-09 15:46:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:38,459 INFO L225 Difference]: With dead ends: 673 [2025-01-09 15:46:38,461 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 15:46:38,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=330, Invalid=1556, Unknown=6, NotChecked=0, Total=1892 [2025-01-09 15:46:38,464 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 726 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 60 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:38,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1636 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1307 Invalid, 4 Unknown, 0 Unchecked, 22.2s Time] [2025-01-09 15:46:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 15:46:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 320. [2025-01-09 15:46:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 271 states have (on average 1.3099630996309963) internal successors, (355), 273 states have internal predecessors, (355), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:46:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 443 transitions. [2025-01-09 15:46:38,499 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 443 transitions. Word has length 139 [2025-01-09 15:46:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:38,500 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 443 transitions. [2025-01-09 15:46:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-01-09 15:46:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 443 transitions. [2025-01-09 15:46:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:46:38,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:38,502 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:46:38,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash 294245563, now seen corresponding path program 1 times [2025-01-09 15:46:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475491123] [2025-01-09 15:46:38,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:46:38,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:46:38,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:38,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:46:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475491123] [2025-01-09 15:46:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475491123] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:46:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172923561] [2025-01-09 15:46:38,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:38,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:46:38,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:46:38,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:46:38,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:46:38,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:46:38,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:46:38,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:38,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:38,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:46:38,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:46:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:46:38,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:46:38,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172923561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:38,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:46:38,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:46:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882090734] [2025-01-09 15:46:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:38,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:46:38,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:38,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:46:38,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:46:38,862 INFO L87 Difference]: Start difference. First operand 320 states and 443 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:38,898 INFO L93 Difference]: Finished difference Result 649 states and 899 transitions. [2025-01-09 15:46:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:46:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-01-09 15:46:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:38,904 INFO L225 Difference]: With dead ends: 649 [2025-01-09 15:46:38,904 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 15:46:38,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 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-01-09 15:46:38,907 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 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-01-09 15:46:38,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:46:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 15:46:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-01-09 15:46:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 285 states have internal predecessors, (367), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:46:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 455 transitions. [2025-01-09 15:46:38,933 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 455 transitions. Word has length 139 [2025-01-09 15:46:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:38,933 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 455 transitions. [2025-01-09 15:46:38,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 455 transitions. [2025-01-09 15:46:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:46:38,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:38,936 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:38,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:46:39,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:46:39,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:39,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash 456580407, now seen corresponding path program 1 times [2025-01-09 15:46:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311562444] [2025-01-09 15:46:39,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:39,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:46:39,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:46:39,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:39,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:46:39,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:39,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311562444] [2025-01-09 15:46:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311562444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:39,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:46:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309596224] [2025-01-09 15:46:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:39,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:46:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:39,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:46:39,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:46:39,536 INFO L87 Difference]: Start difference. First operand 332 states and 455 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:39,750 INFO L93 Difference]: Finished difference Result 655 states and 898 transitions. [2025-01-09 15:46:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:46:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-01-09 15:46:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:39,753 INFO L225 Difference]: With dead ends: 655 [2025-01-09 15:46:39,754 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 15:46:39,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:46:39,757 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 52 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:39,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 683 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:46:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 15:46:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2025-01-09 15:46:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 273 states have (on average 1.293040293040293) internal successors, (353), 275 states have internal predecessors, (353), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:46:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 441 transitions. [2025-01-09 15:46:39,780 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 441 transitions. Word has length 139 [2025-01-09 15:46:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:39,780 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 441 transitions. [2025-01-09 15:46:39,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 441 transitions. [2025-01-09 15:46:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:46:39,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:39,781 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:39,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:46:39,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:39,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1070135586, now seen corresponding path program 1 times [2025-01-09 15:46:39,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:39,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109657721] [2025-01-09 15:46:39,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:39,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:46:39,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:46:39,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:39,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:46:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109657721] [2025-01-09 15:46:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109657721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:40,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:40,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:46:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222483385] [2025-01-09 15:46:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:40,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:46:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:40,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:46:40,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:46:40,522 INFO L87 Difference]: Start difference. First operand 322 states and 441 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:41,227 INFO L93 Difference]: Finished difference Result 781 states and 1067 transitions. [2025-01-09 15:46:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:46:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-01-09 15:46:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:41,230 INFO L225 Difference]: With dead ends: 781 [2025-01-09 15:46:41,230 INFO L226 Difference]: Without dead ends: 462 [2025-01-09 15:46:41,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:46:41,232 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 146 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:41,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1724 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:46:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-09 15:46:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 354. [2025-01-09 15:46:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 305 states have (on average 1.298360655737705) internal successors, (396), 307 states have internal predecessors, (396), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:46:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 484 transitions. [2025-01-09 15:46:41,266 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 484 transitions. Word has length 141 [2025-01-09 15:46:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:41,268 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 484 transitions. [2025-01-09 15:46:41,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 484 transitions. [2025-01-09 15:46:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:46:41,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:41,270 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:41,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:46:41,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1047933120, now seen corresponding path program 1 times [2025-01-09 15:46:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461046643] [2025-01-09 15:46:41,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:41,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:46:41,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:46:41,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:41,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:46:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461046643] [2025-01-09 15:46:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461046643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:41,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:41,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:46:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301108435] [2025-01-09 15:46:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:41,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:46:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:41,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:46:41,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:46:41,961 INFO L87 Difference]: Start difference. First operand 354 states and 484 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:42,601 INFO L93 Difference]: Finished difference Result 996 states and 1353 transitions. [2025-01-09 15:46:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:46:42,602 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-01-09 15:46:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:42,606 INFO L225 Difference]: With dead ends: 996 [2025-01-09 15:46:42,606 INFO L226 Difference]: Without dead ends: 645 [2025-01-09 15:46:42,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:46:42,607 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 236 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:42,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 618 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:46:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-09 15:46:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 622. [2025-01-09 15:46:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 519 states have (on average 1.275529865125241) internal successors, (662), 524 states have internal predecessors, (662), 92 states have call successors, (92), 10 states have call predecessors, (92), 10 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:46:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 846 transitions. [2025-01-09 15:46:42,696 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 846 transitions. Word has length 141 [2025-01-09 15:46:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:42,697 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 846 transitions. [2025-01-09 15:46:42,697 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 846 transitions. [2025-01-09 15:46:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:46:42,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:42,700 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:42,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:46:42,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:42,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1730624769, now seen corresponding path program 1 times [2025-01-09 15:46:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481064256] [2025-01-09 15:46:42,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:42,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:46:42,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:46:42,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:42,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:46:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481064256] [2025-01-09 15:46:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481064256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:44,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:44,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 15:46:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851431561] [2025-01-09 15:46:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 15:46:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:44,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 15:46:44,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:46:44,324 INFO L87 Difference]: Start difference. First operand 622 states and 846 transitions. Second operand has 22 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-09 15:46:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:46,843 INFO L93 Difference]: Finished difference Result 688 states and 913 transitions. [2025-01-09 15:46:46,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 15:46:46,846 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 141 [2025-01-09 15:46:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:46,854 INFO L225 Difference]: With dead ends: 688 [2025-01-09 15:46:46,854 INFO L226 Difference]: Without dead ends: 686 [2025-01-09 15:46:46,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=291, Invalid=1431, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 15:46:46,855 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 707 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:46,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1505 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 15:46:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-01-09 15:46:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 647. [2025-01-09 15:46:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 542 states have (on average 1.2656826568265682) internal successors, (686), 547 states have internal predecessors, (686), 92 states have call successors, (92), 12 states have call predecessors, (92), 12 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:46:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 870 transitions. [2025-01-09 15:46:46,906 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 870 transitions. Word has length 141 [2025-01-09 15:46:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:46,906 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 870 transitions. [2025-01-09 15:46:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-09 15:46:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 870 transitions. [2025-01-09 15:46:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:46:46,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:46,908 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:46,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:46:46,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 966780307, now seen corresponding path program 1 times [2025-01-09 15:46:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:46,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137964720] [2025-01-09 15:46:46,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:46,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:46:46,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:46:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:46,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:46:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137964720] [2025-01-09 15:46:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137964720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:46:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479479839] [2025-01-09 15:46:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:47,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:46:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:47,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:46:47,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:46:47,592 INFO L87 Difference]: Start difference. First operand 647 states and 870 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:48,144 INFO L93 Difference]: Finished difference Result 1345 states and 1809 transitions. [2025-01-09 15:46:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:46:48,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-01-09 15:46:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:48,154 INFO L225 Difference]: With dead ends: 1345 [2025-01-09 15:46:48,158 INFO L226 Difference]: Without dead ends: 701 [2025-01-09 15:46:48,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:46:48,161 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 63 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:48,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1621 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:46:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-01-09 15:46:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 633. [2025-01-09 15:46:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 528 states have (on average 1.2670454545454546) internal successors, (669), 533 states have internal predecessors, (669), 92 states have call successors, (92), 12 states have call predecessors, (92), 12 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:46:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 853 transitions. [2025-01-09 15:46:48,205 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 853 transitions. Word has length 142 [2025-01-09 15:46:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:48,206 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 853 transitions. [2025-01-09 15:46:48,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 853 transitions. [2025-01-09 15:46:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:46:48,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:48,207 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:48,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:46:48,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:48,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1679618141, now seen corresponding path program 1 times [2025-01-09 15:46:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012169794] [2025-01-09 15:46:48,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:48,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:46:48,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:46:48,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:48,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:46:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012169794] [2025-01-09 15:46:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012169794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:48,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:48,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:46:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20340571] [2025-01-09 15:46:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:48,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:46:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:48,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:46:48,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:46:48,752 INFO L87 Difference]: Start difference. First operand 633 states and 853 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:49,081 INFO L93 Difference]: Finished difference Result 1211 states and 1644 transitions. [2025-01-09 15:46:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:46:49,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-01-09 15:46:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:49,087 INFO L225 Difference]: With dead ends: 1211 [2025-01-09 15:46:49,088 INFO L226 Difference]: Without dead ends: 856 [2025-01-09 15:46:49,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:46:49,090 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 74 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:49,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1163 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:46:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-01-09 15:46:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 843. [2025-01-09 15:46:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 715 states have (on average 1.2811188811188812) internal successors, (916), 723 states have internal predecessors, (916), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 104 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 15:46:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1140 transitions. [2025-01-09 15:46:49,138 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1140 transitions. Word has length 142 [2025-01-09 15:46:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:49,138 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1140 transitions. [2025-01-09 15:46:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:46:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1140 transitions. [2025-01-09 15:46:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:46:49,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:49,142 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:49,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:46:49,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:49,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1932657506, now seen corresponding path program 1 times [2025-01-09 15:46:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648748428] [2025-01-09 15:46:49,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:49,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:46:49,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:46:49,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat