./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:45:23,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:45:23,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:45:23,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:45:23,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:45:23,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:45:23,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:45:23,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:45:23,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:45:23,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:45:23,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:45:23,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:45:23,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:45:23,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:45:23,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:45:23,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:45:23,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:45:23,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:45:23,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:45:23,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:45:23,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:45:23,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:45:23,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:45:23,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:45:23,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:45:23,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:45:23,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:45:23,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:45:23,676 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 [2025-03-17 05:45:23,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:45:23,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:45:23,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:45:23,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:45:23,981 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:45:23,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2025-03-17 05:45:25,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddde78ceb/5290ab9e59774b89950dc302cba2c7d1/FLAG24b539004 [2025-03-17 05:45:25,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:45:25,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2025-03-17 05:45:25,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddde78ceb/5290ab9e59774b89950dc302cba2c7d1/FLAG24b539004 [2025-03-17 05:45:25,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddde78ceb/5290ab9e59774b89950dc302cba2c7d1 [2025-03-17 05:45:25,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:45:25,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:45:25,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:45:25,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:45:25,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:45:25,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad90a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25, skipping insertion in model container [2025-03-17 05:45:25,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:45:25,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i[916,929] [2025-03-17 05:45:25,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:45:25,690 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:45:25,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i[916,929] [2025-03-17 05:45:25,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:45:25,741 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:45:25,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25 WrapperNode [2025-03-17 05:45:25,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:45:25,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:45:25,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:45:25,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:45:25,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,800 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2025-03-17 05:45:25,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:45:25,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:45:25,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:45:25,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:45:25,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,851 INFO L175 MemorySlicer]: Split 124 memory accesses to 15 slices as follows [2, 7, 8, 6, 8, 5, 22, 6, 14, 5, 8, 6, 15, 5, 7]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2025-03-17 05:45:25,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:45:25,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:45:25,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:45:25,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:45:25,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (1/1) ... [2025-03-17 05:45:25,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:45:25,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:25,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:45:25,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:45:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:45:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:45:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:45:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:45:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:45:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:45:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:45:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:45:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:45:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 05:45:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:45:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:45:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:45:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-17 05:45:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-17 05:45:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-17 05:45:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:45:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:45:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:45:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:45:25,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:45:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 05:45:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:45:25,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:45:26,140 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:45:26,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:45:26,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~bitwise75#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~ite116#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem112#1;havoc property_#t~short117#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:45:26,678 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2025-03-17 05:45:26,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:45:26,708 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:45:26,709 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:45:26,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:45:26 BoogieIcfgContainer [2025-03-17 05:45:26,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:45:26,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:45:26,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:45:26,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:45:26,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:45:25" (1/3) ... [2025-03-17 05:45:26,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b4d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:45:26, skipping insertion in model container [2025-03-17 05:45:26,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:25" (2/3) ... [2025-03-17 05:45:26,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b4d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:45:26, skipping insertion in model container [2025-03-17 05:45:26,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:45:26" (3/3) ... [2025-03-17 05:45:26,719 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-37.i [2025-03-17 05:45:26,731 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:45:26,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-37.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:45:26,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:45:26,791 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;@202759ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:45:26,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:45:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:45:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:45:26,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:26,806 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:26,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:26,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash -917722531, now seen corresponding path program 1 times [2025-03-17 05:45:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998193403] [2025-03-17 05:45:26,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:26,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:45:26,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:45:26,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:26,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:45:27,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:27,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998193403] [2025-03-17 05:45:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998193403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34209344] [2025-03-17 05:45:27,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:27,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:27,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:27,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:45:27,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:45:27,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:45:27,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:45:27,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:27,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:27,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:45:27,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:45:27,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:27,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34209344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:45:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:45:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258349871] [2025-03-17 05:45:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:45:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:27,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:45:27,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:45:27,480 INFO L87 Difference]: Start difference. First operand has 99 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:45:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:27,508 INFO L93 Difference]: Finished difference Result 195 states and 307 transitions. [2025-03-17 05:45:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:45:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-03-17 05:45:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:27,516 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:45:27,516 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:45:27,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:45:27,522 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:27,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:45:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 05:45:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:45:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2025-03-17 05:45:27,566 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 120 [2025-03-17 05:45:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:27,567 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2025-03-17 05:45:27,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:45:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2025-03-17 05:45:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:45:27,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:27,573 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:27,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:45:27,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:45:27,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:27,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash -302642028, now seen corresponding path program 1 times [2025-03-17 05:45:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634295418] [2025-03-17 05:45:27,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:27,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:45:27,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:45:27,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:27,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:28,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:28,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634295418] [2025-03-17 05:45:28,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634295418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:28,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:28,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:45:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13845552] [2025-03-17 05:45:28,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:28,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:45:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:28,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:45:28,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:28,154 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:28,203 INFO L93 Difference]: Finished difference Result 196 states and 289 transitions. [2025-03-17 05:45:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:45:28,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-03-17 05:45:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:28,205 INFO L225 Difference]: With dead ends: 196 [2025-03-17 05:45:28,206 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 05:45:28,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:28,207 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:28,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 05:45:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-17 05:45:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:45:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2025-03-17 05:45:28,224 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 120 [2025-03-17 05:45:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:28,226 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2025-03-17 05:45:28,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2025-03-17 05:45:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:45:28,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:28,230 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:28,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:45:28,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:28,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2110096491, now seen corresponding path program 1 times [2025-03-17 05:45:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-03-17 05:45:28,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:28,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:45:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:45:28,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-03-17 05:45:28,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382040879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:45:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083890713] [2025-03-17 05:45:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:28,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:45:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:28,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:45:28,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:28,466 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:28,517 INFO L93 Difference]: Finished difference Result 200 states and 293 transitions. [2025-03-17 05:45:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:45:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-03-17 05:45:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:28,521 INFO L225 Difference]: With dead ends: 200 [2025-03-17 05:45:28,521 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 05:45:28,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:28,522 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:28,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 404 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 05:45:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 05:45:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:45:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-03-17 05:45:28,531 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 120 [2025-03-17 05:45:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:28,531 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-03-17 05:45:28,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-03-17 05:45:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:45:28,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:28,533 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:45:28,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:28,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1222592810, now seen corresponding path program 1 times [2025-03-17 05:45:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027634055] [2025-03-17 05:45:28,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:28,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:45:28,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:45:28,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:28,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:28,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027634055] [2025-03-17 05:45:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027634055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:45:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628922048] [2025-03-17 05:45:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:28,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:45:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:28,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:45:28,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:28,721 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:28,747 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2025-03-17 05:45:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:45:28,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-03-17 05:45:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:28,751 INFO L225 Difference]: With dead ends: 204 [2025-03-17 05:45:28,751 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:45:28,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:28,753 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:28,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:45:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 05:45:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:45:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-03-17 05:45:28,762 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 120 [2025-03-17 05:45:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:28,763 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-03-17 05:45:28,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-03-17 05:45:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:45:28,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:28,765 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:28,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:45:28,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:28,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1221669289, now seen corresponding path program 1 times [2025-03-17 05:45:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:28,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577479372] [2025-03-17 05:45:28,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:28,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:45:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:45:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:29,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577479372] [2025-03-17 05:45:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577479372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:29,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:29,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:45:29,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064682493] [2025-03-17 05:45:29,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:29,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:45:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:29,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:45:29,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:45:29,839 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:45:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:30,067 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2025-03-17 05:45:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:45:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2025-03-17 05:45:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:30,069 INFO L225 Difference]: With dead ends: 218 [2025-03-17 05:45:30,070 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:45:30,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:45:30,071 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 204 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:30,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 563 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:45:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 05:45:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 94 states have internal predecessors, (125), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:45:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-03-17 05:45:30,086 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 120 [2025-03-17 05:45:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-03-17 05:45:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:45:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-03-17 05:45:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:45:30,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:30,089 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:30,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:45:30,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:30,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1486632599, now seen corresponding path program 1 times [2025-03-17 05:45:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:30,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688717092] [2025-03-17 05:45:30,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:30,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:30,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:30,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:30,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:30,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:30,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688717092] [2025-03-17 05:45:30,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688717092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:45:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925440388] [2025-03-17 05:45:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:30,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:30,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:30,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:45:30,469 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:45:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:30,692 INFO L93 Difference]: Finished difference Result 326 states and 461 transitions. [2025-03-17 05:45:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:45:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-03-17 05:45:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:30,696 INFO L225 Difference]: With dead ends: 326 [2025-03-17 05:45:30,697 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 05:45:30,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:45:30,697 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 327 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:30,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 412 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 05:45:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-03-17 05:45:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 178 states have (on average 1.348314606741573) internal successors, (240), 180 states have internal predecessors, (240), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:45:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 308 transitions. [2025-03-17 05:45:30,722 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 308 transitions. Word has length 123 [2025-03-17 05:45:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:30,724 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 308 transitions. [2025-03-17 05:45:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:45:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 308 transitions. [2025-03-17 05:45:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:45:30,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:30,726 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:30,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:45:30,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:30,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1300782888, now seen corresponding path program 1 times [2025-03-17 05:45:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-03-17 05:45:30,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:30,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:30,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:30,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:30,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:45:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-03-17 05:45:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619952727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878843315] [2025-03-17 05:45:31,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:31,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:31,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:31,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:45:31,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:45:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:31,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:31,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:31,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:45:31,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:31,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:31,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 05:45:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 05:45:31,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:32,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-17 05:45:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:45:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878843315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:45:32,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:45:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-17 05:45:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146313779] [2025-03-17 05:45:32,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:45:32,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:45:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:32,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:45:32,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:45:32,095 INFO L87 Difference]: Start difference. First operand 217 states and 308 transitions. Second operand has 12 states, 9 states have (on average 7.222222222222222) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (31), 2 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-17 05:45:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:32,435 INFO L93 Difference]: Finished difference Result 368 states and 514 transitions. [2025-03-17 05:45:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:45:32,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.222222222222222) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (31), 2 states have call predecessors, (31), 5 states have call successors, (31) Word has length 123 [2025-03-17 05:45:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:32,437 INFO L225 Difference]: With dead ends: 368 [2025-03-17 05:45:32,437 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 05:45:32,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:45:32,439 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 387 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:32,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 546 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 05:45:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2025-03-17 05:45:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 119 states have internal predecessors, (152), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:45:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 212 transitions. [2025-03-17 05:45:32,459 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 212 transitions. Word has length 123 [2025-03-17 05:45:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:32,459 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 212 transitions. [2025-03-17 05:45:32,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.222222222222222) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (31), 2 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-17 05:45:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 212 transitions. [2025-03-17 05:45:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:45:32,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:32,460 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:32,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:32,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 05:45:32,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:32,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1741369144, now seen corresponding path program 1 times [2025-03-17 05:45:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205794394] [2025-03-17 05:45:32,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:32,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:32,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:32,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:32,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:32,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-17 05:45:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205794394] [2025-03-17 05:45:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205794394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781863473] [2025-03-17 05:45:33,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:33,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:33,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:33,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:45:33,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:45:33,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:33,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:33,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:33,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:33,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:45:33,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:33,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:34,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:34,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-17 05:45:34,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:34,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 05:45:34,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 05:45:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 231 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 05:45:34,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:34,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-03-17 05:45:35,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-03-17 05:45:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:45:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781863473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:45:35,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:45:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 31 [2025-03-17 05:45:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655207931] [2025-03-17 05:45:35,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:45:35,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 05:45:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:35,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 05:45:35,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:45:35,107 INFO L87 Difference]: Start difference. First operand 154 states and 212 transitions. Second operand has 31 states, 26 states have (on average 4.076923076923077) internal successors, (106), 28 states have internal predecessors, (106), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 10 states have call successors, (45) [2025-03-17 05:45:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:36,851 INFO L93 Difference]: Finished difference Result 298 states and 392 transitions. [2025-03-17 05:45:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 05:45:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 4.076923076923077) internal successors, (106), 28 states have internal predecessors, (106), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 10 states have call successors, (45) Word has length 123 [2025-03-17 05:45:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:36,856 INFO L225 Difference]: With dead ends: 298 [2025-03-17 05:45:36,856 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 05:45:36,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=479, Invalid=2277, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 05:45:36,859 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 868 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:36,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1368 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:45:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 05:45:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 143. [2025-03-17 05:45:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 114 states have internal predecessors, (143), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:45:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2025-03-17 05:45:36,880 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 123 [2025-03-17 05:45:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 185 transitions. [2025-03-17 05:45:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 4.076923076923077) internal successors, (106), 28 states have internal predecessors, (106), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 10 states have call successors, (45) [2025-03-17 05:45:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 185 transitions. [2025-03-17 05:45:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:45:36,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:36,882 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:36,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:45:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:37,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1710349337, now seen corresponding path program 1 times [2025-03-17 05:45:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546314371] [2025-03-17 05:45:37,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:37,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:37,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:37,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:37,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546314371] [2025-03-17 05:45:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546314371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:38,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:38,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:45:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482060846] [2025-03-17 05:45:38,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:38,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:45:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:38,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:45:38,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:45:38,103 INFO L87 Difference]: Start difference. First operand 143 states and 185 transitions. Second operand has 17 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:45:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:39,243 INFO L93 Difference]: Finished difference Result 346 states and 463 transitions. [2025-03-17 05:45:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:45:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 123 [2025-03-17 05:45:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:39,246 INFO L225 Difference]: With dead ends: 346 [2025-03-17 05:45:39,246 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 05:45:39,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:45:39,247 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 811 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:39,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 763 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:45:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 05:45:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2025-03-17 05:45:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 114 states have (on average 1.263157894736842) internal successors, (144), 115 states have internal predecessors, (144), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:45:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2025-03-17 05:45:39,269 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 123 [2025-03-17 05:45:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:39,270 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2025-03-17 05:45:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:45:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2025-03-17 05:45:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:45:39,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:39,271 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:45:39,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:39,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2079059334, now seen corresponding path program 1 times [2025-03-17 05:45:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425024842] [2025-03-17 05:45:39,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:39,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:39,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:39,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:39,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:39,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:39,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425024842] [2025-03-17 05:45:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425024842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:39,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:45:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71498498] [2025-03-17 05:45:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:39,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:39,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:39,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:45:39,511 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:39,594 INFO L93 Difference]: Finished difference Result 291 states and 373 transitions. [2025-03-17 05:45:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:45:39,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2025-03-17 05:45:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:39,599 INFO L225 Difference]: With dead ends: 291 [2025-03-17 05:45:39,599 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 05:45:39,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:45:39,600 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 104 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:39,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 683 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 05:45:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-03-17 05:45:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 131 states have internal predecessors, (160), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:45:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 210 transitions. [2025-03-17 05:45:39,619 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 210 transitions. Word has length 123 [2025-03-17 05:45:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 210 transitions. [2025-03-17 05:45:39,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 210 transitions. [2025-03-17 05:45:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:45:39,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:39,621 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:45:39,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:39,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1077066150, now seen corresponding path program 1 times [2025-03-17 05:45:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158836633] [2025-03-17 05:45:39,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:39,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:45:39,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:45:39,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:39,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158836633] [2025-03-17 05:45:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158836633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:39,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:45:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361530452] [2025-03-17 05:45:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:39,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:45:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:39,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:45:39,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:45:39,941 INFO L87 Difference]: Start difference. First operand 167 states and 210 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:45:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:40,247 INFO L93 Difference]: Finished difference Result 311 states and 396 transitions. [2025-03-17 05:45:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:45:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-03-17 05:45:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:40,249 INFO L225 Difference]: With dead ends: 311 [2025-03-17 05:45:40,249 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 05:45:40,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:45:40,250 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 315 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:40,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 609 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 05:45:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2025-03-17 05:45:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 137 states have (on average 1.218978102189781) internal successors, (167), 138 states have internal predecessors, (167), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:45:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 227 transitions. [2025-03-17 05:45:40,278 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 227 transitions. Word has length 123 [2025-03-17 05:45:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:40,280 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 227 transitions. [2025-03-17 05:45:40,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:45:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2025-03-17 05:45:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:45:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:40,281 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:45:40,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash 662615617, now seen corresponding path program 1 times [2025-03-17 05:45:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400425678] [2025-03-17 05:45:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:40,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:45:40,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:45:40,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:40,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:45:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400425678] [2025-03-17 05:45:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400425678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785674458] [2025-03-17 05:45:41,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:41,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:45:41,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:45:41,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:45:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:45:41,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:41,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 05:45:41,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:41,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:41,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:41,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 05:45:42,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 05:45:42,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:45:42,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 05:45:42,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 87 [2025-03-17 05:45:42,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 55 [2025-03-17 05:45:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 239 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-17 05:45:42,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:42,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:45:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:43,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785674458] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:43,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:45:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 26 [2025-03-17 05:45:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147229508] [2025-03-17 05:45:43,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:43,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:45:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:43,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:45:43,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:45:43,125 INFO L87 Difference]: Start difference. First operand 180 states and 227 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:43,584 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2025-03-17 05:45:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:45:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-03-17 05:45:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:43,587 INFO L225 Difference]: With dead ends: 186 [2025-03-17 05:45:43,587 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 05:45:43,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 05:45:43,588 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 178 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:43,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 657 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 05:45:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2025-03-17 05:45:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 140 states have (on average 1.2142857142857142) internal successors, (170), 141 states have internal predecessors, (170), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:45:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2025-03-17 05:45:43,615 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 125 [2025-03-17 05:45:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:43,615 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2025-03-17 05:45:43,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2025-03-17 05:45:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:45:43,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:43,616 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:43,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:43,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:43,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 663539138, now seen corresponding path program 1 times [2025-03-17 05:45:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914109078] [2025-03-17 05:45:43,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:43,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:45:43,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:45:43,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:43,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:44,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914109078] [2025-03-17 05:45:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914109078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:44,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:44,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224752909] [2025-03-17 05:45:44,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:44,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:44,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:44,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:44,011 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:44,070 INFO L93 Difference]: Finished difference Result 311 states and 392 transitions. [2025-03-17 05:45:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-03-17 05:45:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:44,071 INFO L225 Difference]: With dead ends: 311 [2025-03-17 05:45:44,071 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 05:45:44,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:45:44,072 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 113 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:44,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 613 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 05:45:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2025-03-17 05:45:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 140 states have (on average 1.207142857142857) internal successors, (169), 141 states have internal predecessors, (169), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:45:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 229 transitions. [2025-03-17 05:45:44,102 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 229 transitions. Word has length 125 [2025-03-17 05:45:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:44,102 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 229 transitions. [2025-03-17 05:45:44,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 229 transitions. [2025-03-17 05:45:44,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:45:44,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:44,105 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:44,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:45:44,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:44,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1551042819, now seen corresponding path program 1 times [2025-03-17 05:45:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:44,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648240522] [2025-03-17 05:45:44,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:44,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:45:44,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:45:44,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:44,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:44,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648240522] [2025-03-17 05:45:44,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648240522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:44,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:44,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677924573] [2025-03-17 05:45:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:44,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:44,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:44,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:44,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:44,272 INFO L87 Difference]: Start difference. First operand 183 states and 229 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:44,363 INFO L93 Difference]: Finished difference Result 310 states and 389 transitions. [2025-03-17 05:45:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:44,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-03-17 05:45:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:44,365 INFO L225 Difference]: With dead ends: 310 [2025-03-17 05:45:44,365 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 05:45:44,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:45:44,366 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 80 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:44,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 443 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 05:45:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-17 05:45:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 140 states have (on average 1.2) internal successors, (168), 141 states have internal predecessors, (168), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:45:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 228 transitions. [2025-03-17 05:45:44,389 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 228 transitions. Word has length 125 [2025-03-17 05:45:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:44,389 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 228 transitions. [2025-03-17 05:45:44,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 228 transitions. [2025-03-17 05:45:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:45:44,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:44,390 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:45:44,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:44,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash -256411644, now seen corresponding path program 1 times [2025-03-17 05:45:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:44,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717684490] [2025-03-17 05:45:44,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:44,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:45:44,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:45:44,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:44,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 51 proven. 27 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-17 05:45:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717684490] [2025-03-17 05:45:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717684490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117652450] [2025-03-17 05:45:45,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:45,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:45,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:45,938 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:45:45,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:45:46,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:45:46,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:45:46,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:46,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:46,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 05:45:46,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:46,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 05:45:46,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:47,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75 [2025-03-17 05:45:47,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2025-03-17 05:45:47,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-03-17 05:45:47,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 187 [2025-03-17 05:45:47,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-03-17 05:45:47,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 98 [2025-03-17 05:45:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 14 proven. 330 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-17 05:45:47,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:47,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2025-03-17 05:45:47,996 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-17 05:45:47,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 1 [2025-03-17 05:45:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117652450] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:45:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19, 20] total 37 [2025-03-17 05:45:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289712472] [2025-03-17 05:45:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:48,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:48,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1214, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:45:48,055 INFO L87 Difference]: Start difference. First operand 183 states and 228 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:48,264 INFO L93 Difference]: Finished difference Result 382 states and 474 transitions. [2025-03-17 05:45:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:45:48,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-03-17 05:45:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:48,267 INFO L225 Difference]: With dead ends: 382 [2025-03-17 05:45:48,267 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 05:45:48,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:45:48,268 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 64 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:48,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 684 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 05:45:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 200. [2025-03-17 05:45:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 157 states have (on average 1.2101910828025477) internal successors, (190), 158 states have internal predecessors, (190), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:45:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2025-03-17 05:45:48,301 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 125 [2025-03-17 05:45:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:48,301 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2025-03-17 05:45:48,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:45:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2025-03-17 05:45:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:45:48,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:48,303 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:48,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:45:48,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 05:45:48,504 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:48,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:48,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1948256177, now seen corresponding path program 1 times [2025-03-17 05:45:48,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:48,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398136508] [2025-03-17 05:45:48,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:48,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:45:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:45:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:45:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398136508] [2025-03-17 05:45:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398136508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:45:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294478446] [2025-03-17 05:45:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:48,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:48,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:48,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:45:48,755 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:45:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:48,868 INFO L93 Difference]: Finished difference Result 344 states and 431 transitions. [2025-03-17 05:45:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:48,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-17 05:45:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:48,870 INFO L225 Difference]: With dead ends: 344 [2025-03-17 05:45:48,870 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 05:45:48,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:45:48,871 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 200 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:48,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 238 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 05:45:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-17 05:45:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 157 states have (on average 1.2038216560509554) internal successors, (189), 158 states have internal predecessors, (189), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:45:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2025-03-17 05:45:48,891 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 127 [2025-03-17 05:45:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:48,891 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2025-03-17 05:45:48,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:45:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2025-03-17 05:45:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:45:48,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:48,893 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:48,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:45:48,893 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1881249424, now seen corresponding path program 1 times [2025-03-17 05:45:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:45:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354530401] [2025-03-17 05:45:48,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:45:48,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:45:48,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:45:48,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:48,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-17 05:45:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:45:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354530401] [2025-03-17 05:45:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354530401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949554196] [2025-03-17 05:45:50,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:50,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:45:50,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:50,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:45:50,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:45:50,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:45:50,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:45:50,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:50,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:50,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-17 05:45:50,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:51,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:51,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:52,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:45:53,060 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-17 05:45:53,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2025-03-17 05:45:53,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 05:45:53,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:45:53,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 05:45:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 7 proven. 333 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 05:45:53,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:54,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-03-17 05:45:55,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2025-03-17 05:45:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-17 05:45:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949554196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:45:55,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:45:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 64 [2025-03-17 05:45:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366596784] [2025-03-17 05:45:55,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:45:55,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-17 05:45:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:45:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-17 05:45:55,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2025-03-17 05:45:55,626 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand has 64 states, 54 states have (on average 2.7962962962962963) internal successors, (151), 59 states have internal predecessors, (151), 23 states have call successors, (45), 8 states have call predecessors, (45), 12 states have return successors, (45), 15 states have call predecessors, (45), 23 states have call successors, (45) [2025-03-17 05:46:05,173 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-03-17 05:46:17,378 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-03-17 05:46:21,390 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-03-17 05:46:25,436 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-03-17 05:46:29,466 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-03-17 05:46:31,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []