./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.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-ap_file-39.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 b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:34:25,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:34:25,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:34:25,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:34:25,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:34:25,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:34:25,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:34:25,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:34:25,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:34:25,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:34:25,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:34:25,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:34:25,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:34:25,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:34:25,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:34:25,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:34:25,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:34:25,424 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 -> b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 [2025-03-17 05:34:25,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:34:25,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:34:25,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:34:25,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:34:25,661 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:34:25,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-17 05:34:26,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e9655fe/31ff86cb1b8b492983b77a8ec10b474f/FLAG1b648084a [2025-03-17 05:34:27,035 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:34:27,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-17 05:34:27,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e9655fe/31ff86cb1b8b492983b77a8ec10b474f/FLAG1b648084a [2025-03-17 05:34:27,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e9655fe/31ff86cb1b8b492983b77a8ec10b474f [2025-03-17 05:34:27,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:34:27,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:34:27,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:34:27,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:34:27,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:34:27,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6804ba55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27, skipping insertion in model container [2025-03-17 05:34:27,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:34:27,502 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-ap_file-39.i[917,930] [2025-03-17 05:34:27,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:34:27,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:34:27,584 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-ap_file-39.i[917,930] [2025-03-17 05:34:27,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:34:27,633 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:34:27,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27 WrapperNode [2025-03-17 05:34:27,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:34:27,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:34:27,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:34:27,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:34:27,638 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:34:27" (1/1) ... [2025-03-17 05:34:27,645 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:34:27" (1/1) ... [2025-03-17 05:34:27,665 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 613 [2025-03-17 05:34:27,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:34:27,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:34:27,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:34:27,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:34:27,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,697 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2025-03-17 05:34:27,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:34:27,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:34:27,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:34:27,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:34:27,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (1/1) ... [2025-03-17 05:34:27,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:34:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:34:27,750 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:34:27,753 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:34:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:34:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:34:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:34:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:34:27,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:34:27,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:34:27,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:34:27,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:34:27,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:34:27,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:34:27,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:34:27,872 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:34:27,873 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:34:28,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem113#1;havoc property_#t~mem106#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite131#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem123#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short132#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~bitwise135#1;havoc property_#t~mem137#1;havoc property_#t~ite176#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem142#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite173#1;havoc property_#t~mem170#1;havoc property_#t~mem148#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~ite155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~ite169#1;havoc property_#t~mem161#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite160#1;havoc property_#t~mem158#1;havoc property_#t~mem159#1;havoc property_#t~ite168#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~mem172#1;havoc property_#t~mem171#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short177#1; [2025-03-17 05:34:28,281 INFO L? ?]: Removed 186 outVars from TransFormulas that were not future-live. [2025-03-17 05:34:28,281 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:34:28,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:34:28,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:34:28,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:34:28 BoogieIcfgContainer [2025-03-17 05:34:28,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:34:28,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:34:28,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:34:28,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:34:28,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:34:27" (1/3) ... [2025-03-17 05:34:28,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44764a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:34:28, skipping insertion in model container [2025-03-17 05:34:28,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:34:27" (2/3) ... [2025-03-17 05:34:28,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44764a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:34:28, skipping insertion in model container [2025-03-17 05:34:28,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:34:28" (3/3) ... [2025-03-17 05:34:28,306 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-17 05:34:28,317 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:34:28,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-39.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:34:28,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:34:28,363 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;@6b0ee6bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:34:28,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:34:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:34:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:34:28,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:28,375 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:28,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1061202756, now seen corresponding path program 1 times [2025-03-17 05:34:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456062337] [2025-03-17 05:34:28,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:28,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:34:28,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:34:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:34:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456062337] [2025-03-17 05:34:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456062337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:34:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613859760] [2025-03-17 05:34:28,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:28,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:34:28,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:34:28,650 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:34:28,652 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:34:28,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:34:28,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:34:28,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:28,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:28,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:34:28,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:34:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:34:28,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:34:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613859760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:34:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:34:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:34:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666427862] [2025-03-17 05:34:28,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:34:28,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:34:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:34:28,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:34:28,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:34:28,899 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:34:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:34:28,930 INFO L93 Difference]: Finished difference Result 225 states and 354 transitions. [2025-03-17 05:34:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:34:28,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2025-03-17 05:34:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:34:28,940 INFO L225 Difference]: With dead ends: 225 [2025-03-17 05:34:28,940 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:34:28,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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:34:28,944 INFO L435 NwaCegarLoop]: 164 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, 164 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:34:28,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:34:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:34:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 05:34:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:34:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2025-03-17 05:34:28,972 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 124 [2025-03-17 05:34:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:34:28,972 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2025-03-17 05:34:28,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:34:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2025-03-17 05:34:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:34:28,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:28,974 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:28,981 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:34:29,176 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:34:29,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:29,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash -820556694, now seen corresponding path program 1 times [2025-03-17 05:34:29,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689513173] [2025-03-17 05:34:29,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:29,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:34:29,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:34:29,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:29,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:34:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:29,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689513173] [2025-03-17 05:34:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689513173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:34:29,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:34:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:34:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776889812] [2025-03-17 05:34:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:34:29,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:34:29,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:34:29,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:34:29,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:34:29,434 INFO L87 Difference]: Start difference. First operand 112 states and 166 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:34:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:34:29,472 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2025-03-17 05:34:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:34:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2025-03-17 05:34:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:34:29,474 INFO L225 Difference]: With dead ends: 225 [2025-03-17 05:34:29,474 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:34:29,474 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:34:29,475 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:34:29,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:34:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:34:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-17 05:34:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:34:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2025-03-17 05:34:29,482 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 124 [2025-03-17 05:34:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:34:29,483 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2025-03-17 05:34:29,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:34:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2025-03-17 05:34:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:34:29,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:29,484 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:29,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:34:29,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:29,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash 463354473, now seen corresponding path program 1 times [2025-03-17 05:34:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:29,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870365843] [2025-03-17 05:34:29,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:34:29,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:34:29,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:29,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:34:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870365843] [2025-03-17 05:34:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870365843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:34:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:34:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:34:31,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435257497] [2025-03-17 05:34:31,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:34:31,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:34:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:34:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:34:31,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:34:31,908 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:34:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:34:33,875 INFO L93 Difference]: Finished difference Result 382 states and 559 transitions. [2025-03-17 05:34:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:34:33,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-17 05:34:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:34:33,877 INFO L225 Difference]: With dead ends: 382 [2025-03-17 05:34:33,877 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 05:34:33,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:34:33,879 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 400 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:34:33,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 2506 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:34:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 05:34:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2025-03-17 05:34:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 224 states have (on average 1.4330357142857142) internal successors, (321), 226 states have internal predecessors, (321), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:34:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 369 transitions. [2025-03-17 05:34:33,904 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 369 transitions. Word has length 124 [2025-03-17 05:34:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:34:33,904 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 369 transitions. [2025-03-17 05:34:33,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:34:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 369 transitions. [2025-03-17 05:34:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:34:33,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:33,909 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:33,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:34:33,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:33,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1344099990, now seen corresponding path program 1 times [2025-03-17 05:34:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:33,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359152521] [2025-03-17 05:34:33,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:33,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:34:33,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:34:33,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:33,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:34:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359152521] [2025-03-17 05:34:34,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359152521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:34:34,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:34:34,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:34:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907449710] [2025-03-17 05:34:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:34:34,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:34:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:34:34,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:34:34,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:34:34,669 INFO L87 Difference]: Start difference. First operand 252 states and 369 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:34:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:34:35,213 INFO L93 Difference]: Finished difference Result 590 states and 864 transitions. [2025-03-17 05:34:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:34:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 124 [2025-03-17 05:34:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:34:35,216 INFO L225 Difference]: With dead ends: 590 [2025-03-17 05:34:35,216 INFO L226 Difference]: Without dead ends: 339 [2025-03-17 05:34:35,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:34:35,218 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 497 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:34:35,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 569 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:34:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-17 05:34:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 274. [2025-03-17 05:34:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 246 states have (on average 1.434959349593496) internal successors, (353), 248 states have internal predecessors, (353), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:34:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2025-03-17 05:34:35,245 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 124 [2025-03-17 05:34:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:34:35,246 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2025-03-17 05:34:35,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:34:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2025-03-17 05:34:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:34:35,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:35,248 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:35,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:34:35,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:35,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1816664170, now seen corresponding path program 1 times [2025-03-17 05:34:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:35,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235348501] [2025-03-17 05:34:35,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:35,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:34:35,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:34:35,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:34:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235348501] [2025-03-17 05:34:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235348501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:34:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:34:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:34:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865892751] [2025-03-17 05:34:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:34:35,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:34:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:34:35,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:34:35,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:34:35,942 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:34:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:34:36,536 INFO L93 Difference]: Finished difference Result 555 states and 807 transitions. [2025-03-17 05:34:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:34:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 124 [2025-03-17 05:34:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:34:36,539 INFO L225 Difference]: With dead ends: 555 [2025-03-17 05:34:36,540 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 05:34:36,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:34:36,542 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 290 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:34:36,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 897 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:34:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 05:34:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 215. [2025-03-17 05:34:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 192 states have (on average 1.421875) internal successors, (273), 193 states have internal predecessors, (273), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:34:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2025-03-17 05:34:36,563 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 124 [2025-03-17 05:34:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:34:36,564 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2025-03-17 05:34:36,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:34:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2025-03-17 05:34:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:34:36,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:36,566 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:36,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:34:36,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 9209707, now seen corresponding path program 1 times [2025-03-17 05:34:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709174291] [2025-03-17 05:34:36,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:36,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:34:36,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:34:36,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:34:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709174291] [2025-03-17 05:34:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709174291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:34:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:34:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:34:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841997139] [2025-03-17 05:34:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:34:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:34:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:34:43,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:34:43,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:34:43,885 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:34:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:34:54,662 INFO L93 Difference]: Finished difference Result 580 states and 837 transitions. [2025-03-17 05:34:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:34:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 124 [2025-03-17 05:34:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:34:54,667 INFO L225 Difference]: With dead ends: 580 [2025-03-17 05:34:54,667 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 05:34:54,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:34:54,669 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 560 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:34:54,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2434 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-17 05:34:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 05:34:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 227. [2025-03-17 05:34:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 204 states have (on average 1.4166666666666667) internal successors, (289), 205 states have internal predecessors, (289), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:34:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 327 transitions. [2025-03-17 05:34:54,691 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 327 transitions. Word has length 124 [2025-03-17 05:34:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:34:54,692 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 327 transitions. [2025-03-17 05:34:54,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:34:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 327 transitions. [2025-03-17 05:34:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:34:54,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:54,693 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:54,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:34:54,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:54,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash 542999640, now seen corresponding path program 1 times [2025-03-17 05:34:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890159999] [2025-03-17 05:34:54,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:54,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:54,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:34:54,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:34:54,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:54,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:34:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890159999] [2025-03-17 05:34:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890159999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:34:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:34:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:34:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906286077] [2025-03-17 05:34:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:34:56,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:34:56,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:34:56,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:34:56,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:34:56,111 INFO L87 Difference]: Start difference. First operand 227 states and 327 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:34:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:34:57,836 INFO L93 Difference]: Finished difference Result 581 states and 836 transitions. [2025-03-17 05:34:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:34:57,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:34:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:34:57,841 INFO L225 Difference]: With dead ends: 581 [2025-03-17 05:34:57,841 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 05:34:57,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:34:57,843 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 281 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:34:57,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1278 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:34:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 05:34:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 225. [2025-03-17 05:34:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 202 states have (on average 1.4158415841584158) internal successors, (286), 203 states have internal predecessors, (286), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:34:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 324 transitions. [2025-03-17 05:34:57,868 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 324 transitions. Word has length 125 [2025-03-17 05:34:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:34:57,868 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 324 transitions. [2025-03-17 05:34:57,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:34:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 324 transitions. [2025-03-17 05:34:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:34:57,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:34:57,869 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:57,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:34:57,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:34:57,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:34:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2033440120, now seen corresponding path program 1 times [2025-03-17 05:34:57,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:34:57,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078103027] [2025-03-17 05:34:57,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:34:57,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:34:57,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:34:57,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:57,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:34:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:34:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078103027] [2025-03-17 05:34:59,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078103027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:34:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178212533] [2025-03-17 05:34:59,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:34:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:34:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:34:59,496 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:34:59,498 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:34:59,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:34:59,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:34:59,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:34:59,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:34:59,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-17 05:34:59,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:35:01,096 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:35:01,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:35:02,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 05:35:03,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2025-03-17 05:35:04,746 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 05:35:04,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 119 [2025-03-17 05:35:04,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:04,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:04,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:04,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:04,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 135 [2025-03-17 05:35:04,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:04,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:04,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:04,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2025-03-17 05:35:05,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 05:35:05,490 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:35:06,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:06,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:06,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:06,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:06,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:35:06,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 55 [2025-03-17 05:35:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 168 proven. 226 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-17 05:35:07,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:35:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178212533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:35:17,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:35:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 31] total 45 [2025-03-17 05:35:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377937775] [2025-03-17 05:35:17,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:35:17,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-17 05:35:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:35:17,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-17 05:35:17,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=2804, Unknown=1, NotChecked=0, Total=3192 [2025-03-17 05:35:17,167 INFO L87 Difference]: Start difference. First operand 225 states and 324 transitions. Second operand has 45 states, 40 states have (on average 2.75) internal successors, (110), 40 states have internal predecessors, (110), 10 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 9 states have call predecessors, (32), 10 states have call successors, (32) [2025-03-17 05:35:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:35:33,511 INFO L93 Difference]: Finished difference Result 756 states and 1071 transitions. [2025-03-17 05:35:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-17 05:35:33,512 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.75) internal successors, (110), 40 states have internal predecessors, (110), 10 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 9 states have call predecessors, (32), 10 states have call successors, (32) Word has length 125 [2025-03-17 05:35:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:35:33,514 INFO L225 Difference]: With dead ends: 756 [2025-03-17 05:35:33,514 INFO L226 Difference]: Without dead ends: 532 [2025-03-17 05:35:33,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3346 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=2054, Invalid=11517, Unknown=1, NotChecked=0, Total=13572 [2025-03-17 05:35:33,518 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1112 mSDsluCounter, 4167 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 4375 SdHoareTripleChecker+Invalid, 4964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:35:33,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 4375 Invalid, 4964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-17 05:35:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-17 05:35:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 252. [2025-03-17 05:35:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 224 states have (on average 1.3973214285714286) internal successors, (313), 225 states have internal predecessors, (313), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:35:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 351 transitions. [2025-03-17 05:35:33,547 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 351 transitions. Word has length 125 [2025-03-17 05:35:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:35:33,547 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 351 transitions. [2025-03-17 05:35:33,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.75) internal successors, (110), 40 states have internal predecessors, (110), 10 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 9 states have call predecessors, (32), 10 states have call successors, (32) [2025-03-17 05:35:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 351 transitions. [2025-03-17 05:35:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:35:33,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:35:33,551 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:33,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:35:33,751 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,SelfDestructingSolverStorable7 [2025-03-17 05:35:33,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:35:33,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:35:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1642620064, now seen corresponding path program 1 times [2025-03-17 05:35:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:35:33,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251110598] [2025-03-17 05:35:33,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:35:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:35:33,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:35:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:35:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:35:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:35:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:35:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:35:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251110598] [2025-03-17 05:35:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251110598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:35:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:35:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:35:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179450077] [2025-03-17 05:35:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:35:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:35:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:35:34,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:35:34,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:35:34,101 INFO L87 Difference]: Start difference. First operand 252 states and 351 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:35:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:35:34,867 INFO L93 Difference]: Finished difference Result 584 states and 816 transitions. [2025-03-17 05:35:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:35:34,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2025-03-17 05:35:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:35:34,869 INFO L225 Difference]: With dead ends: 584 [2025-03-17 05:35:34,869 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 05:35:34,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:35:34,870 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 428 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:35:34,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1030 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:35:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 05:35:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 264. [2025-03-17 05:35:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 236 states have (on average 1.4067796610169492) internal successors, (332), 237 states have internal predecessors, (332), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:35:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2025-03-17 05:35:34,901 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 126 [2025-03-17 05:35:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:35:34,902 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2025-03-17 05:35:34,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:35:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2025-03-17 05:35:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:35:34,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:35:34,904 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:35:34,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:35:34,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:35:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash -471266504, now seen corresponding path program 1 times [2025-03-17 05:35:34,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:35:34,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621915743] [2025-03-17 05:35:34,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:35:34,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:35:34,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:35:34,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:35:34,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:35:34,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:35:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-17 05:35:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:35:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621915743] [2025-03-17 05:35:38,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621915743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:35:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925351609] [2025-03-17 05:35:38,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:35:38,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:35:38,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:35:38,874 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:35:38,875 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:35:38,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:35:39,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:35:39,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:35:39,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:35:39,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-17 05:35:39,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:35:40,266 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:35:41,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-17 05:35:41,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2025-03-17 05:35:42,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2025-03-17 05:35:45,365 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 05:35:45,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 131 [2025-03-17 05:35:45,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 143 [2025-03-17 05:35:45,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:35:45,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2025-03-17 05:35:46,540 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:35:46,899 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:35:48,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:35:48,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 205 treesize of output 169 [2025-03-17 05:35:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 209 proven. 216 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 05:35:49,281 INFO L312 TraceCheckSpWp]: Computing backward predicates...