./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-sp_file-76.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 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:06:14,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:06:14,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:06:14,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:06:14,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:06:14,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:06:14,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:06:14,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:06:14,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:06:14,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:06:14,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:06:14,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:06:14,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:06:14,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:06:14,806 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:06:14,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:06:14,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:06:14,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:06:14,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:06:14,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:06:14,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:06:14,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:06:14,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:06:14,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:06:14,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:06:14,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:06:14,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:06:14,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:06:14,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:06:14,810 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 -> 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 [2025-03-08 17:06:15,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:06:15,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:06:15,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:06:15,043 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:06:15,044 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:06:15,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2025-03-08 17:06:16,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a9c3661/88a161f29b0240dd9a3f6c0923cdeea6/FLAG61ea884f9 [2025-03-08 17:06:16,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:06:16,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2025-03-08 17:06:16,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a9c3661/88a161f29b0240dd9a3f6c0923cdeea6/FLAG61ea884f9 [2025-03-08 17:06:16,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a9c3661/88a161f29b0240dd9a3f6c0923cdeea6 [2025-03-08 17:06:16,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:06:16,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:06:16,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:06:16,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:06:16,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:06:16,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11eaa356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16, skipping insertion in model container [2025-03-08 17:06:16,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:06:16,609 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-sp_file-76.i[917,930] [2025-03-08 17:06:16,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:06:16,672 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:06:16,678 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-sp_file-76.i[917,930] [2025-03-08 17:06:16,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:06:16,731 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:06:16,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16 WrapperNode [2025-03-08 17:06:16,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:06:16,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:06:16,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:06:16,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:06:16,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,781 INFO L138 Inliner]: procedures = 30, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2025-03-08 17:06:16,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:06:16,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:06:16,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:06:16,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:06:16,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,813 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:06:16,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:06:16,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:06:16,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:06:16,844 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:06:16,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (1/1) ... [2025-03-08 17:06:16,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:06:16,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:06:16,868 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-08 17:06:16,870 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-08 17:06:16,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:06:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:06:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:06:16,967 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:06:16,969 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:06:17,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~ite66#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem65#1;havoc property_#t~mem64#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem69#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem70#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~short76#1;havoc property_#t~mem77#1;havoc property_#t~ite93#1;havoc property_#t~mem83#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short94#1;havoc property_#t~mem95#1;havoc property_#t~ite108#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1; [2025-03-08 17:06:17,298 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-03-08 17:06:17,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:06:17,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:06:17,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:06:17,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:06:17 BoogieIcfgContainer [2025-03-08 17:06:17,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:06:17,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:06:17,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:06:17,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:06:17,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:06:16" (1/3) ... [2025-03-08 17:06:17,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1778ac55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:06:17, skipping insertion in model container [2025-03-08 17:06:17,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:16" (2/3) ... [2025-03-08 17:06:17,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1778ac55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:06:17, skipping insertion in model container [2025-03-08 17:06:17,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:06:17" (3/3) ... [2025-03-08 17:06:17,319 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-76.i [2025-03-08 17:06:17,329 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:06:17,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-76.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:06:17,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:06:17,375 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;@562a3082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:06:17,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:06:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 17:06:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 17:06:17,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:17,387 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:17,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:17,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 580118133, now seen corresponding path program 1 times [2025-03-08 17:06:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110657494] [2025-03-08 17:06:17,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:17,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 17:06:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 17:06:17,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:17,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 17:06:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110657494] [2025-03-08 17:06:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110657494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:06:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857294038] [2025-03-08 17:06:17,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:17,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:06:17,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:06:17,700 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-08 17:06:17,703 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-08 17:06:17,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 17:06:17,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 17:06:17,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:17,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:17,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:06:17,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:06:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 17:06:17,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:06:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857294038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:17,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:06:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:06:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473814581] [2025-03-08 17:06:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:17,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:06:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:17,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:06:17,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:06:17,905 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 17:06:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:17,920 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-03-08 17:06:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:06:17,921 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-03-08 17:06:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:17,925 INFO L225 Difference]: With dead ends: 192 [2025-03-08 17:06:17,925 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 17:06:17,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-08 17:06:17,929 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:17,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 17:06:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 17:06:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 17:06:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2025-03-08 17:06:17,961 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2025-03-08 17:06:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2025-03-08 17:06:17,962 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 17:06:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2025-03-08 17:06:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 17:06:17,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:17,968 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:17,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:06:18,168 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-08 17:06:18,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1684946745, now seen corresponding path program 1 times [2025-03-08 17:06:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902064255] [2025-03-08 17:06:18,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:18,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 17:06:18,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 17:06:18,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:18,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902064255] [2025-03-08 17:06:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902064255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:06:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205310690] [2025-03-08 17:06:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:18,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:06:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:18,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:06:18,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:06:18,507 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:18,528 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2025-03-08 17:06:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:06:18,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-03-08 17:06:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:18,529 INFO L225 Difference]: With dead ends: 185 [2025-03-08 17:06:18,529 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 17:06:18,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:06:18,530 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:18,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 17:06:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 17:06:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 17:06:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-03-08 17:06:18,537 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 119 [2025-03-08 17:06:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:18,538 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-03-08 17:06:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-03-08 17:06:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 17:06:18,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:18,540 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:18,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:06:18,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 556071901, now seen corresponding path program 1 times [2025-03-08 17:06:18,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:18,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758955991] [2025-03-08 17:06:18,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:18,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:18,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 17:06:18,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 17:06:18,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:18,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758955991] [2025-03-08 17:06:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758955991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:18,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:06:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370689698] [2025-03-08 17:06:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:06:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:18,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:06:18,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:06:18,970 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:19,219 INFO L93 Difference]: Finished difference Result 277 states and 391 transitions. [2025-03-08 17:06:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:06:19,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-03-08 17:06:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:19,221 INFO L225 Difference]: With dead ends: 277 [2025-03-08 17:06:19,224 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 17:06:19,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:06:19,225 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 100 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:19,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 393 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:06:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 17:06:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 137. [2025-03-08 17:06:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 104 states have internal predecessors, (132), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2025-03-08 17:06:19,251 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 120 [2025-03-08 17:06:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:19,252 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2025-03-08 17:06:19,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2025-03-08 17:06:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 17:06:19,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:19,257 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:19,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:06:19,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash 767422814, now seen corresponding path program 1 times [2025-03-08 17:06:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409227785] [2025-03-08 17:06:19,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:19,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 17:06:19,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 17:06:19,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:19,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:21,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:21,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409227785] [2025-03-08 17:06:21,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409227785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:21,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:21,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:06:21,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245730808] [2025-03-08 17:06:21,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:21,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:06:21,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:21,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:06:21,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:21,407 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:22,003 INFO L93 Difference]: Finished difference Result 278 states and 391 transitions. [2025-03-08 17:06:22,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:06:22,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2025-03-08 17:06:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:22,005 INFO L225 Difference]: With dead ends: 278 [2025-03-08 17:06:22,005 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 17:06:22,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:06:22,006 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 426 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:22,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 473 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:06:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 17:06:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2025-03-08 17:06:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2025-03-08 17:06:22,027 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 120 [2025-03-08 17:06:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:22,029 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2025-03-08 17:06:22,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2025-03-08 17:06:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 17:06:22,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:22,032 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:22,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:06:22,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2065683492, now seen corresponding path program 1 times [2025-03-08 17:06:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821233689] [2025-03-08 17:06:22,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:22,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 17:06:22,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 17:06:22,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:22,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:22,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821233689] [2025-03-08 17:06:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821233689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:22,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:22,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:06:22,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776077995] [2025-03-08 17:06:22,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:22,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:06:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:22,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:06:22,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:06:22,375 INFO L87 Difference]: Start difference. First operand 154 states and 216 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:22,668 INFO L93 Difference]: Finished difference Result 268 states and 379 transitions. [2025-03-08 17:06:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:06:22,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 17:06:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:22,670 INFO L225 Difference]: With dead ends: 268 [2025-03-08 17:06:22,670 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 17:06:22,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:06:22,671 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 94 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:22,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 379 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:06:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 17:06:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-03-08 17:06:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2025-03-08 17:06:22,707 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 122 [2025-03-08 17:06:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:22,708 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2025-03-08 17:06:22,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2025-03-08 17:06:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 17:06:22,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:22,710 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:22,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:06:22,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:22,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash 683078613, now seen corresponding path program 1 times [2025-03-08 17:06:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:22,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140797949] [2025-03-08 17:06:22,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:22,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 17:06:22,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 17:06:22,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:22,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:22,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:22,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140797949] [2025-03-08 17:06:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140797949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:06:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279253820] [2025-03-08 17:06:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:22,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:06:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:22,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:06:22,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:06:22,823 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:22,852 INFO L93 Difference]: Finished difference Result 266 states and 373 transitions. [2025-03-08 17:06:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:06:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 17:06:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:22,854 INFO L225 Difference]: With dead ends: 266 [2025-03-08 17:06:22,854 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 17:06:22,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:06:22,855 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:22,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 17:06:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-08 17:06:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 123 states have internal predecessors, (157), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 217 transitions. [2025-03-08 17:06:22,876 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 217 transitions. Word has length 122 [2025-03-08 17:06:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:22,876 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 217 transitions. [2025-03-08 17:06:22,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 217 transitions. [2025-03-08 17:06:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 17:06:22,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:22,878 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:22,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:06:22,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -624008742, now seen corresponding path program 1 times [2025-03-08 17:06:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325533733] [2025-03-08 17:06:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:22,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 17:06:22,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 17:06:22,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:22,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:24,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325533733] [2025-03-08 17:06:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325533733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:06:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191613679] [2025-03-08 17:06:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:24,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:06:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:24,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:06:24,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:24,386 INFO L87 Difference]: Start difference. First operand 156 states and 217 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:25,284 INFO L93 Difference]: Finished difference Result 311 states and 432 transitions. [2025-03-08 17:06:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:06:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 124 [2025-03-08 17:06:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:25,286 INFO L225 Difference]: With dead ends: 311 [2025-03-08 17:06:25,287 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 17:06:25,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:06:25,288 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 206 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:25,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 616 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 17:06:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 17:06:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2025-03-08 17:06:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 130 states have internal predecessors, (166), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 226 transitions. [2025-03-08 17:06:25,308 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 226 transitions. Word has length 124 [2025-03-08 17:06:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:25,308 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 226 transitions. [2025-03-08 17:06:25,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 226 transitions. [2025-03-08 17:06:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 17:06:25,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:25,310 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:25,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:06:25,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1509533029, now seen corresponding path program 1 times [2025-03-08 17:06:25,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:25,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036788367] [2025-03-08 17:06:25,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:25,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 17:06:25,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 17:06:25,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:25,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 17:06:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036788367] [2025-03-08 17:06:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036788367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:06:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608413587] [2025-03-08 17:06:25,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:25,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:06:25,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:06:25,463 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-08 17:06:25,464 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-08 17:06:25,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 17:06:25,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 17:06:25,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:25,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:25,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 17:06:25,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:06:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:25,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:06:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608413587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:06:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 17:06:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868906205] [2025-03-08 17:06:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:25,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:06:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:25,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:06:25,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:06:25,669 INFO L87 Difference]: Start difference. First operand 163 states and 226 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:25,701 INFO L93 Difference]: Finished difference Result 284 states and 394 transitions. [2025-03-08 17:06:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:06:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-08 17:06:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:25,706 INFO L225 Difference]: With dead ends: 284 [2025-03-08 17:06:25,707 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 17:06:25,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:06:25,707 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:25,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 17:06:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-08 17:06:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 134 states have internal predecessors, (170), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 230 transitions. [2025-03-08 17:06:25,726 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 230 transitions. Word has length 124 [2025-03-08 17:06:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:25,726 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 230 transitions. [2025-03-08 17:06:25,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2025-03-08 17:06:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 17:06:25,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:25,727 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:25,735 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-08 17:06:25,928 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-08 17:06:25,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:25,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 746835928, now seen corresponding path program 1 times [2025-03-08 17:06:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445942171] [2025-03-08 17:06:25,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 17:06:25,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 17:06:25,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:25,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445942171] [2025-03-08 17:06:26,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445942171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:26,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:26,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:06:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339632797] [2025-03-08 17:06:26,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:26,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:06:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:26,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:06:26,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:26,122 INFO L87 Difference]: Start difference. First operand 167 states and 230 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:26,222 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2025-03-08 17:06:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:06:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-08 17:06:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:26,223 INFO L225 Difference]: With dead ends: 297 [2025-03-08 17:06:26,223 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 17:06:26,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:06:26,224 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:26,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:06:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 17:06:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2025-03-08 17:06:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 137 states have internal predecessors, (173), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2025-03-08 17:06:26,240 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 126 [2025-03-08 17:06:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:26,241 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2025-03-08 17:06:26,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2025-03-08 17:06:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 17:06:26,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:26,242 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:26,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:06:26,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:26,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash 241277303, now seen corresponding path program 1 times [2025-03-08 17:06:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019984439] [2025-03-08 17:06:26,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:26,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 17:06:26,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 17:06:26,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:26,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019984439] [2025-03-08 17:06:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019984439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:28,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 17:06:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141133368] [2025-03-08 17:06:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:28,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 17:06:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:28,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 17:06:28,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:06:28,686 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:30,107 INFO L93 Difference]: Finished difference Result 383 states and 515 transitions. [2025-03-08 17:06:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:06:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 126 [2025-03-08 17:06:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:30,110 INFO L225 Difference]: With dead ends: 383 [2025-03-08 17:06:30,110 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 17:06:30,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2025-03-08 17:06:30,111 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 389 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:30,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 807 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 17:06:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 17:06:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2025-03-08 17:06:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 137 states have internal predecessors, (173), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 17:06:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2025-03-08 17:06:30,129 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 126 [2025-03-08 17:06:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:30,130 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2025-03-08 17:06:30,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2025-03-08 17:06:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 17:06:30,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:30,131 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:30,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:06:30,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:30,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash 236301751, now seen corresponding path program 1 times [2025-03-08 17:06:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197437027] [2025-03-08 17:06:30,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:30,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 17:06:30,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 17:06:30,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:30,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197437027] [2025-03-08 17:06:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197437027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:06:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955249185] [2025-03-08 17:06:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:31,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:06:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:31,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:06:31,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:31,452 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:32,182 INFO L93 Difference]: Finished difference Result 353 states and 477 transitions. [2025-03-08 17:06:32,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:06:32,183 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 126 [2025-03-08 17:06:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:32,184 INFO L225 Difference]: With dead ends: 353 [2025-03-08 17:06:32,184 INFO L226 Difference]: Without dead ends: 229 [2025-03-08 17:06:32,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-08 17:06:32,185 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 515 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:32,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 459 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:06:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-08 17:06:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2025-03-08 17:06:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 185 states have (on average 1.2540540540540541) internal successors, (232), 186 states have internal predecessors, (232), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:06:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 300 transitions. [2025-03-08 17:06:32,199 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 300 transitions. Word has length 126 [2025-03-08 17:06:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:32,199 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 300 transitions. [2025-03-08 17:06:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 17:06:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 300 transitions. [2025-03-08 17:06:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 17:06:32,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:32,200 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:32,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:06:32,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:32,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash -269256874, now seen corresponding path program 1 times [2025-03-08 17:06:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800827525] [2025-03-08 17:06:32,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:32,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 17:06:32,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 17:06:32,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:32,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:34,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800827525] [2025-03-08 17:06:34,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800827525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:34,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:34,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 17:06:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659921788] [2025-03-08 17:06:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:34,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:06:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:34,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:06:34,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:06:34,125 INFO L87 Difference]: Start difference. First operand 223 states and 300 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 17:06:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:34,874 INFO L93 Difference]: Finished difference Result 477 states and 634 transitions. [2025-03-08 17:06:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:06:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 126 [2025-03-08 17:06:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:34,876 INFO L225 Difference]: With dead ends: 477 [2025-03-08 17:06:34,876 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 17:06:34,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-03-08 17:06:34,877 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 389 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:34,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 565 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:06:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 17:06:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 216. [2025-03-08 17:06:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 178 states have (on average 1.2584269662921348) internal successors, (224), 179 states have internal predecessors, (224), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:06:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 292 transitions. [2025-03-08 17:06:34,901 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 292 transitions. Word has length 126 [2025-03-08 17:06:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:34,902 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 292 transitions. [2025-03-08 17:06:34,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 17:06:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 292 transitions. [2025-03-08 17:06:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 17:06:34,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:34,904 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:34,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:06:34,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:34,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash -501856647, now seen corresponding path program 1 times [2025-03-08 17:06:34,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:34,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172558978] [2025-03-08 17:06:34,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:34,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 17:06:34,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 17:06:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 17:06:35,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172558978] [2025-03-08 17:06:35,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172558978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:35,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:35,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:06:35,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454758650] [2025-03-08 17:06:35,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:35,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:06:35,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:35,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:06:35,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:06:35,131 INFO L87 Difference]: Start difference. First operand 216 states and 292 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:35,406 INFO L93 Difference]: Finished difference Result 461 states and 618 transitions. [2025-03-08 17:06:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:06:35,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-08 17:06:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:35,407 INFO L225 Difference]: With dead ends: 461 [2025-03-08 17:06:35,407 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 17:06:35,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:06:35,408 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 131 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:35,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 355 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:06:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 17:06:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 237. [2025-03-08 17:06:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 199 states have (on average 1.2512562814070352) internal successors, (249), 200 states have internal predecessors, (249), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:06:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 317 transitions. [2025-03-08 17:06:35,433 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 317 transitions. Word has length 126 [2025-03-08 17:06:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:35,434 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 317 transitions. [2025-03-08 17:06:35,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 17:06:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 317 transitions. [2025-03-08 17:06:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 17:06:35,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:35,436 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:35,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:06:35,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:35,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1480147632, now seen corresponding path program 1 times [2025-03-08 17:06:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:35,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181671980] [2025-03-08 17:06:35,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:35,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:35,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 17:06:35,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 17:06:35,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:35,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat