./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:25:39,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:25:39,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:25:39,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:25:39,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:25:39,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:25:39,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:25:39,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:25:39,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:25:39,133 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:25:39,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:25:39,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:25:39,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:25:39,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:25:39,134 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:25:39,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:25:39,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:25:39,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:25:39,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:25:39,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:25:39,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:25:39,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:25:39,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:25:39,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:39,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:39,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:39,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:25:39,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:39,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:39,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:39,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:39,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:25:39,138 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df [2025-01-09 15:25:39,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:25:39,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:25:39,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:25:39,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:25:39,423 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:25:39,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i [2025-01-09 15:25:40,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c606a91ba/abef72c55cba4588a5e9ac412a6d8dcf/FLAG11dea6b26 [2025-01-09 15:25:40,949 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:25:40,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i [2025-01-09 15:25:40,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c606a91ba/abef72c55cba4588a5e9ac412a6d8dcf/FLAG11dea6b26 [2025-01-09 15:25:40,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c606a91ba/abef72c55cba4588a5e9ac412a6d8dcf [2025-01-09 15:25:40,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:25:40,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:25:40,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:40,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:25:40,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:25:40,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:40" (1/1) ... [2025-01-09 15:25:40,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f22b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:40, skipping insertion in model container [2025-01-09 15:25:40,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:40" (1/1) ... [2025-01-09 15:25:40,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:25:41,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i[916,929] [2025-01-09 15:25:41,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:41,211 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:25:41,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i[916,929] [2025-01-09 15:25:41,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:41,290 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:25:41,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41 WrapperNode [2025-01-09 15:25:41,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:41,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:41,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:25:41,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:25:41,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,358 INFO L138 Inliner]: procedures = 26, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-01-09 15:25:41,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:41,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:25:41,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:25:41,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:25:41,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,406 INFO L175 MemorySlicer]: Split 138 memory accesses to 6 slices as follows [2, 20, 16, 85, 7, 8]. 62 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 1, 2]. The 18 writes are split as follows [0, 3, 3, 8, 1, 3]. [2025-01-09 15:25:41,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:25:41,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:25:41,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:25:41,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:25:41,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (1/1) ... [2025-01-09 15:25:41,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:41,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:41,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:25:41,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:25:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:25:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:25:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:25:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:25:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:25:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:25:41,510 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:25:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:25:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:25:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:25:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:25:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:25:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:25:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:25:41,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:25:41,628 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:25:41,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:25:42,154 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:25:42,154 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:25:42,169 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:25:42,170 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:25:42,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:42 BoogieIcfgContainer [2025-01-09 15:25:42,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:25:42,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:25:42,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:25:42,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:25:42,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:25:40" (1/3) ... [2025-01-09 15:25:42,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d177b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:42, skipping insertion in model container [2025-01-09 15:25:42,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:41" (2/3) ... [2025-01-09 15:25:42,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d177b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:42, skipping insertion in model container [2025-01-09 15:25:42,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:42" (3/3) ... [2025-01-09 15:25:42,179 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-71.i [2025-01-09 15:25:42,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:25:42,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:25:42,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:25:42,259 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;@3fc2f12f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:25:42,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:25:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:25:42,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:42,277 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:42,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:42,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1545980022, now seen corresponding path program 1 times [2025-01-09 15:25:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:42,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505400806] [2025-01-09 15:25:42,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:42,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:25:42,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:25:42,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:42,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:25:42,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:42,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505400806] [2025-01-09 15:25:42,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505400806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:42,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890499064] [2025-01-09 15:25:42,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:42,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:42,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:25:42,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:25:42,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:25:42,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:25:42,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:42,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:42,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:25:42,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:25:42,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890499064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:42,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:25:42,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966931691] [2025-01-09 15:25:42,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:25:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:42,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:25:42,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:42,881 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:25:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:42,914 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-01-09 15:25:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:25:42,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-01-09 15:25:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:42,924 INFO L225 Difference]: With dead ends: 202 [2025-01-09 15:25:42,925 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:25:42,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:42,932 INFO L435 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:42,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:25:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 15:25:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-01-09 15:25:42,972 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-01-09 15:25:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:42,973 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-01-09 15:25:42,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:25:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-01-09 15:25:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:25:42,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:42,976 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:42,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:43,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:25:43,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:43,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:43,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1743471844, now seen corresponding path program 1 times [2025-01-09 15:25:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:43,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034564138] [2025-01-09 15:25:43,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:43,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:25:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:25:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:43,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:43,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:43,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034564138] [2025-01-09 15:25:43,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034564138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:43,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:25:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546512740] [2025-01-09 15:25:43,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:43,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:25:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:43,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:25:43,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:43,427 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:43,464 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-01-09 15:25:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:25:43,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:25:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:43,474 INFO L225 Difference]: With dead ends: 200 [2025-01-09 15:25:43,474 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 15:25:43,474 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-01-09 15:25:43,477 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:43,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 15:25:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 15:25:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2025-01-09 15:25:43,499 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 144 [2025-01-09 15:25:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:43,500 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2025-01-09 15:25:43,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2025-01-09 15:25:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:25:43,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:43,504 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:43,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:25:43,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash -463608166, now seen corresponding path program 1 times [2025-01-09 15:25:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448806258] [2025-01-09 15:25:43,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:43,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:25:43,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:25:43,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:43,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448806258] [2025-01-09 15:25:43,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448806258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:43,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:43,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:25:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633627864] [2025-01-09 15:25:43,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:43,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:43,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:43,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:43,751 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:43,789 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2025-01-09 15:25:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:43,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:25:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:43,795 INFO L225 Difference]: With dead ends: 204 [2025-01-09 15:25:43,795 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 15:25:43,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:43,798 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:43,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 15:25:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-01-09 15:25:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2025-01-09 15:25:43,835 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 144 [2025-01-09 15:25:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:43,836 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2025-01-09 15:25:43,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2025-01-09 15:25:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:25:43,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:43,838 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:25:43,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:43,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1311399196, now seen corresponding path program 1 times [2025-01-09 15:25:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033508807] [2025-01-09 15:25:43,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:43,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:25:43,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:25:43,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:43,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:44,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033508807] [2025-01-09 15:25:44,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033508807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:44,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:25:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488920043] [2025-01-09 15:25:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:44,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:44,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:44,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:44,009 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:44,047 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2025-01-09 15:25:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:25:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:44,051 INFO L225 Difference]: With dead ends: 208 [2025-01-09 15:25:44,052 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 15:25:44,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:44,053 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:44,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 15:25:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-09 15:25:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2025-01-09 15:25:44,066 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 144 [2025-01-09 15:25:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:44,068 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2025-01-09 15:25:44,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2025-01-09 15:25:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:25:44,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:44,072 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:44,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:25:44,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:44,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1313246238, now seen corresponding path program 1 times [2025-01-09 15:25:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666191675] [2025-01-09 15:25:44,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:44,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:25:44,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:25:44,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:44,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:44,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666191675] [2025-01-09 15:25:44,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666191675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076171602] [2025-01-09 15:25:44,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:44,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:44,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:44,460 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:44,555 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2025-01-09 15:25:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:44,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:25:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:44,559 INFO L225 Difference]: With dead ends: 269 [2025-01-09 15:25:44,559 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 15:25:44,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:44,560 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 87 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:44,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 709 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 15:25:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2025-01-09 15:25:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2025-01-09 15:25:44,575 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 144 [2025-01-09 15:25:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:44,576 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2025-01-09 15:25:44,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2025-01-09 15:25:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:25:44,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:44,578 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:44,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:25:44,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:44,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1496792562, now seen corresponding path program 1 times [2025-01-09 15:25:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:44,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273798975] [2025-01-09 15:25:44,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:44,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:44,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:25:44,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:25:44,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:44,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273798975] [2025-01-09 15:25:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273798975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429461647] [2025-01-09 15:25:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:45,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:45,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:45,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:45,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:45,067 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:45,201 INFO L93 Difference]: Finished difference Result 274 states and 385 transitions. [2025-01-09 15:25:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:25:45,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2025-01-09 15:25:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:45,204 INFO L225 Difference]: With dead ends: 274 [2025-01-09 15:25:45,204 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 15:25:45,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:25:45,205 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 82 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:45,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 761 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 15:25:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2025-01-09 15:25:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-01-09 15:25:45,215 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 145 [2025-01-09 15:25:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:45,215 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-01-09 15:25:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-01-09 15:25:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:25:45,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:45,221 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:45,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:25:45,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:45,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1887889559, now seen corresponding path program 1 times [2025-01-09 15:25:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625532882] [2025-01-09 15:25:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:45,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:25:45,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:25:45,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:45,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:47,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:47,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625532882] [2025-01-09 15:25:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625532882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:47,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:47,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:25:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212349401] [2025-01-09 15:25:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:47,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:25:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:47,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:25:47,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:47,099 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:25:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:47,801 INFO L93 Difference]: Finished difference Result 386 states and 542 transitions. [2025-01-09 15:25:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:25:47,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2025-01-09 15:25:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:47,803 INFO L225 Difference]: With dead ends: 386 [2025-01-09 15:25:47,804 INFO L226 Difference]: Without dead ends: 274 [2025-01-09 15:25:47,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:25:47,805 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 262 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:47,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1300 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:25:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-09 15:25:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 194. [2025-01-09 15:25:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 160 states have internal predecessors, (209), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 15:25:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 273 transitions. [2025-01-09 15:25:47,829 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 273 transitions. Word has length 146 [2025-01-09 15:25:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:47,830 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 273 transitions. [2025-01-09 15:25:47,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:25:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 273 transitions. [2025-01-09 15:25:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:25:47,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:47,832 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:47,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:25:47,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:47,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:47,833 INFO L85 PathProgramCache]: Analyzing trace with hash 636186974, now seen corresponding path program 1 times [2025-01-09 15:25:47,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580858643] [2025-01-09 15:25:47,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:47,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:25:47,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:25:47,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:47,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580858643] [2025-01-09 15:25:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580858643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469205733] [2025-01-09 15:25:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:48,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:48,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:48,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:48,272 INFO L87 Difference]: Start difference. First operand 194 states and 273 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:25:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:48,381 INFO L93 Difference]: Finished difference Result 447 states and 625 transitions. [2025-01-09 15:25:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2025-01-09 15:25:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:48,385 INFO L225 Difference]: With dead ends: 447 [2025-01-09 15:25:48,385 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 15:25:48,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:48,386 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 66 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:48,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 621 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 15:25:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-01-09 15:25:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 214 states have internal predecessors, (278), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:25:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 350 transitions. [2025-01-09 15:25:48,403 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 350 transitions. Word has length 146 [2025-01-09 15:25:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:48,404 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 350 transitions. [2025-01-09 15:25:48,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:25:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 350 transitions. [2025-01-09 15:25:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:25:48,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:48,405 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:48,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:25:48,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:48,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1319935353, now seen corresponding path program 1 times [2025-01-09 15:25:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360307242] [2025-01-09 15:25:48,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:48,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:25:48,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:25:48,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:48,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360307242] [2025-01-09 15:25:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360307242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:25:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706494047] [2025-01-09 15:25:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:25:48,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:48,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:25:48,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:48,811 INFO L87 Difference]: Start difference. First operand 253 states and 350 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:49,001 INFO L93 Difference]: Finished difference Result 547 states and 749 transitions. [2025-01-09 15:25:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:25:49,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-01-09 15:25:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:49,007 INFO L225 Difference]: With dead ends: 547 [2025-01-09 15:25:49,008 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 15:25:49,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:49,009 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 183 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:49,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 837 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 15:25:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2025-01-09 15:25:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 249 states have internal predecessors, (320), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:25:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2025-01-09 15:25:49,029 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 147 [2025-01-09 15:25:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:49,030 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2025-01-09 15:25:49,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2025-01-09 15:25:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:25:49,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:49,032 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:49,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:25:49,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:49,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash -875757078, now seen corresponding path program 1 times [2025-01-09 15:25:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:49,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155551937] [2025-01-09 15:25:49,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:49,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:25:49,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:25:49,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:49,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:49,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155551937] [2025-01-09 15:25:49,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155551937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:49,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:49,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:25:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079094772] [2025-01-09 15:25:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:49,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:25:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:49,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:25:49,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:25:49,687 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:25:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:50,077 INFO L93 Difference]: Finished difference Result 712 states and 967 transitions. [2025-01-09 15:25:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:25:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2025-01-09 15:25:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:50,081 INFO L225 Difference]: With dead ends: 712 [2025-01-09 15:25:50,081 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 15:25:50,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:25:50,082 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 94 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:50,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1187 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:25:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 15:25:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2025-01-09 15:25:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 358 states have (on average 1.2849162011173185) internal successors, (460), 363 states have internal predecessors, (460), 55 states have call successors, (55), 8 states have call predecessors, (55), 8 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 15:25:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 570 transitions. [2025-01-09 15:25:50,119 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 570 transitions. Word has length 147 [2025-01-09 15:25:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:50,120 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 570 transitions. [2025-01-09 15:25:50,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:25:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 570 transitions. [2025-01-09 15:25:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:25:50,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:50,123 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:50,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:25:50,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:50,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2139346540, now seen corresponding path program 1 times [2025-01-09 15:25:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:50,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109277697] [2025-01-09 15:25:50,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:50,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:25:50,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:25:50,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:50,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:51,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109277697] [2025-01-09 15:25:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109277697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:51,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:25:51,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780151034] [2025-01-09 15:25:51,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:51,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:25:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:51,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:25:51,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:51,261 INFO L87 Difference]: Start difference. First operand 422 states and 570 transitions. Second operand has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:25:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:52,061 INFO L93 Difference]: Finished difference Result 879 states and 1181 transitions. [2025-01-09 15:25:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:25:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-01-09 15:25:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:52,065 INFO L225 Difference]: With dead ends: 879 [2025-01-09 15:25:52,065 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 15:25:52,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:25:52,066 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 109 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:52,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 925 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:25:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 15:25:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 435. [2025-01-09 15:25:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 364 states have (on average 1.2692307692307692) internal successors, (462), 370 states have internal predecessors, (462), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 15:25:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 580 transitions. [2025-01-09 15:25:52,114 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 580 transitions. Word has length 147 [2025-01-09 15:25:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:52,114 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 580 transitions. [2025-01-09 15:25:52,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:25:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 580 transitions. [2025-01-09 15:25:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:25:52,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:52,118 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:52,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:25:52,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:52,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash -735208468, now seen corresponding path program 1 times [2025-01-09 15:25:52,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:52,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597080490] [2025-01-09 15:25:52,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:52,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:52,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:25:52,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:25:52,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:52,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597080490] [2025-01-09 15:25:53,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597080490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:53,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:53,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:25:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742464240] [2025-01-09 15:25:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:53,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:25:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:53,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:25:53,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:53,023 INFO L87 Difference]: Start difference. First operand 435 states and 580 transitions. Second operand has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:25:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:53,683 INFO L93 Difference]: Finished difference Result 875 states and 1170 transitions. [2025-01-09 15:25:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:25:53,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2025-01-09 15:25:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:53,686 INFO L225 Difference]: With dead ends: 875 [2025-01-09 15:25:53,686 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 15:25:53,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:25:53,688 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 107 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:53,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1068 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:25:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 15:25:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 395. [2025-01-09 15:25:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 329 states have (on average 1.2644376899696048) internal successors, (416), 334 states have internal predecessors, (416), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 15:25:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 526 transitions. [2025-01-09 15:25:53,727 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 526 transitions. Word has length 147 [2025-01-09 15:25:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:53,728 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 526 transitions. [2025-01-09 15:25:53,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:25:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 526 transitions. [2025-01-09 15:25:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:25:53,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:53,730 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:53,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:25:53,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:53,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2015072146, now seen corresponding path program 1 times [2025-01-09 15:25:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731731706] [2025-01-09 15:25:53,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:53,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:25:53,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:25:53,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:53,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:54,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731731706] [2025-01-09 15:25:54,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731731706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:54,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:54,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:54,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803939574] [2025-01-09 15:25:54,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:54,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:54,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:54,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:54,015 INFO L87 Difference]: Start difference. First operand 395 states and 526 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:54,336 INFO L93 Difference]: Finished difference Result 861 states and 1151 transitions. [2025-01-09 15:25:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-01-09 15:25:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:54,339 INFO L225 Difference]: With dead ends: 861 [2025-01-09 15:25:54,340 INFO L226 Difference]: Without dead ends: 486 [2025-01-09 15:25:54,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:54,341 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 111 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1209 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-01-09 15:25:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 473. [2025-01-09 15:25:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 385 states have (on average 1.2441558441558442) internal successors, (479), 391 states have internal predecessors, (479), 74 states have call successors, (74), 13 states have call predecessors, (74), 13 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 15:25:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 627 transitions. [2025-01-09 15:25:54,385 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 627 transitions. Word has length 147 [2025-01-09 15:25:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:54,386 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 627 transitions. [2025-01-09 15:25:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 627 transitions. [2025-01-09 15:25:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:25:54,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:54,388 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:54,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:25:54,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash 513518131, now seen corresponding path program 1 times [2025-01-09 15:25:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266618364] [2025-01-09 15:25:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:54,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:25:54,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:25:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266618364] [2025-01-09 15:25:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266618364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:54,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:54,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:54,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852400297] [2025-01-09 15:25:54,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:54,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:54,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:54,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:54,548 INFO L87 Difference]: Start difference. First operand 473 states and 627 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:54,662 INFO L93 Difference]: Finished difference Result 931 states and 1235 transitions. [2025-01-09 15:25:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:54,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 15:25:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:54,666 INFO L225 Difference]: With dead ends: 931 [2025-01-09 15:25:54,666 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 15:25:54,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:54,668 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 52 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:54,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 580 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 15:25:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 459. [2025-01-09 15:25:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 376 states have (on average 1.247340425531915) internal successors, (469), 381 states have internal predecessors, (469), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 15:25:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 609 transitions. [2025-01-09 15:25:54,713 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 609 transitions. Word has length 148 [2025-01-09 15:25:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:54,713 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 609 transitions. [2025-01-09 15:25:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 609 transitions. [2025-01-09 15:25:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:25:54,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:54,715 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:54,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:25:54,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1324237321, now seen corresponding path program 1 times [2025-01-09 15:25:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:54,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780233808] [2025-01-09 15:25:54,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:54,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:25:54,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:25:54,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:54,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780233808] [2025-01-09 15:25:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780233808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:54,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:54,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464188988] [2025-01-09 15:25:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:54,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:54,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:54,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:54,898 INFO L87 Difference]: Start difference. First operand 459 states and 609 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:55,019 INFO L93 Difference]: Finished difference Result 917 states and 1216 transitions. [2025-01-09 15:25:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 15:25:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:55,023 INFO L225 Difference]: With dead ends: 917 [2025-01-09 15:25:55,023 INFO L226 Difference]: Without dead ends: 461 [2025-01-09 15:25:55,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:55,026 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 62 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:55,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 582 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-01-09 15:25:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-01-09 15:25:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 376 states have (on average 1.2446808510638299) internal successors, (468), 381 states have internal predecessors, (468), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 15:25:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 608 transitions. [2025-01-09 15:25:55,080 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 608 transitions. Word has length 148 [2025-01-09 15:25:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:55,081 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 608 transitions. [2025-01-09 15:25:55,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 608 transitions. [2025-01-09 15:25:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:25:55,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:55,084 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:55,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:25:55,084 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:55,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2101866033, now seen corresponding path program 1 times [2025-01-09 15:25:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054069233] [2025-01-09 15:25:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:25:55,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:25:55,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:55,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054069233] [2025-01-09 15:25:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054069233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310941227] [2025-01-09 15:25:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:55,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:55,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:55,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:55,253 INFO L87 Difference]: Start difference. First operand 459 states and 608 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:55,356 INFO L93 Difference]: Finished difference Result 912 states and 1207 transitions. [2025-01-09 15:25:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:55,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 15:25:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:55,359 INFO L225 Difference]: With dead ends: 912 [2025-01-09 15:25:55,359 INFO L226 Difference]: Without dead ends: 456 [2025-01-09 15:25:55,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:55,361 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 61 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:55,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 634 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-01-09 15:25:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2025-01-09 15:25:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 371 states have (on average 1.2398921832884098) internal successors, (460), 376 states have internal predecessors, (460), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 15:25:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 600 transitions. [2025-01-09 15:25:55,400 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 600 transitions. Word has length 148 [2025-01-09 15:25:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:55,400 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 600 transitions. [2025-01-09 15:25:55,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:25:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 600 transitions. [2025-01-09 15:25:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:25:55,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:55,402 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:25:55,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1056823534, now seen corresponding path program 1 times [2025-01-09 15:25:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:55,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500712382] [2025-01-09 15:25:55,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:55,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:25:55,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:25:55,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:55,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:57,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500712382] [2025-01-09 15:25:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500712382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 15:25:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362530742] [2025-01-09 15:25:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:25:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:57,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:25:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:25:57,258 INFO L87 Difference]: Start difference. First operand 454 states and 600 transitions. Second operand has 19 states, 16 states have (on average 3.5) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:25:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:59,301 INFO L93 Difference]: Finished difference Result 1078 states and 1439 transitions. [2025-01-09 15:25:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 15:25:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.5) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-01-09 15:25:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:59,307 INFO L225 Difference]: With dead ends: 1078 [2025-01-09 15:25:59,308 INFO L226 Difference]: Without dead ends: 627 [2025-01-09 15:25:59,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 15:25:59,310 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 254 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:59,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 2629 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 15:25:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-01-09 15:25:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 543. [2025-01-09 15:25:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 446 states have (on average 1.2556053811659194) internal successors, (560), 452 states have internal predecessors, (560), 83 states have call successors, (83), 13 states have call predecessors, (83), 13 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 15:25:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 726 transitions. [2025-01-09 15:25:59,364 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 726 transitions. Word has length 148 [2025-01-09 15:25:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:59,364 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 726 transitions. [2025-01-09 15:25:59,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.5) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:25:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 726 transitions. [2025-01-09 15:25:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:25:59,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:59,367 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:59,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:25:59,368 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:59,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash -250391908, now seen corresponding path program 1 times [2025-01-09 15:25:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:59,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780242938] [2025-01-09 15:25:59,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:59,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:59,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:25:59,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:25:59,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:59,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780242938] [2025-01-09 15:26:00,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780242938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:00,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753914279] [2025-01-09 15:26:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:00,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:00,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:00,063 INFO L87 Difference]: Start difference. First operand 543 states and 726 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:00,567 INFO L93 Difference]: Finished difference Result 1322 states and 1767 transitions. [2025-01-09 15:26:00,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:26:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:00,575 INFO L225 Difference]: With dead ends: 1322 [2025-01-09 15:26:00,575 INFO L226 Difference]: Without dead ends: 782 [2025-01-09 15:26:00,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:00,577 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 99 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:00,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 974 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:26:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-01-09 15:26:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 778. [2025-01-09 15:26:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 615 states have (on average 1.2276422764227641) internal successors, (755), 623 states have internal predecessors, (755), 141 states have call successors, (141), 21 states have call predecessors, (141), 21 states have return successors, (141), 133 states have call predecessors, (141), 141 states have call successors, (141) [2025-01-09 15:26:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1037 transitions. [2025-01-09 15:26:00,654 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1037 transitions. Word has length 149 [2025-01-09 15:26:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:00,654 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1037 transitions. [2025-01-09 15:26:00,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1037 transitions. [2025-01-09 15:26:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:26:00,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:00,657 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:00,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:26:00,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:00,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2031313747, now seen corresponding path program 1 times [2025-01-09 15:26:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370013050] [2025-01-09 15:26:00,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:00,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:26:00,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:26:00,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:00,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370013050] [2025-01-09 15:26:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370013050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:26:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012081912] [2025-01-09 15:26:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:00,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:26:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:00,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:26:00,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:26:00,883 INFO L87 Difference]: Start difference. First operand 778 states and 1037 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:01,068 INFO L93 Difference]: Finished difference Result 1549 states and 2052 transitions. [2025-01-09 15:26:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:26:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:26:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:01,073 INFO L225 Difference]: With dead ends: 1549 [2025-01-09 15:26:01,073 INFO L226 Difference]: Without dead ends: 774 [2025-01-09 15:26:01,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:01,075 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 66 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:01,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 826 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:26:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-01-09 15:26:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 750. [2025-01-09 15:26:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 593 states have (on average 1.21247892074199) internal successors, (719), 601 states have internal predecessors, (719), 132 states have call successors, (132), 24 states have call predecessors, (132), 24 states have return successors, (132), 124 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 15:26:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 983 transitions. [2025-01-09 15:26:01,138 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 983 transitions. Word has length 149 [2025-01-09 15:26:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:01,138 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 983 transitions. [2025-01-09 15:26:01,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 983 transitions. [2025-01-09 15:26:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:01,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:01,141 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:01,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:26:01,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:01,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2116819280, now seen corresponding path program 1 times [2025-01-09 15:26:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:01,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866065392] [2025-01-09 15:26:01,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:01,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:01,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:01,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:01,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866065392] [2025-01-09 15:26:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866065392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:26:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924863414] [2025-01-09 15:26:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:02,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:26:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:02,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:26:02,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:26:02,848 INFO L87 Difference]: Start difference. First operand 750 states and 983 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:04,215 INFO L93 Difference]: Finished difference Result 1610 states and 2102 transitions. [2025-01-09 15:26:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:26:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-01-09 15:26:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:04,220 INFO L225 Difference]: With dead ends: 1610 [2025-01-09 15:26:04,221 INFO L226 Difference]: Without dead ends: 863 [2025-01-09 15:26:04,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:26:04,225 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 250 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:04,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 2020 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:26:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-01-09 15:26:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 764. [2025-01-09 15:26:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 607 states have (on average 1.2092257001647446) internal successors, (734), 615 states have internal predecessors, (734), 132 states have call successors, (132), 24 states have call predecessors, (132), 24 states have return successors, (132), 124 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 15:26:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 998 transitions. [2025-01-09 15:26:04,292 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 998 transitions. Word has length 150 [2025-01-09 15:26:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:04,292 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 998 transitions. [2025-01-09 15:26:04,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 998 transitions. [2025-01-09 15:26:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:04,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:04,294 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:04,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:26:04,295 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:04,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 372709682, now seen corresponding path program 1 times [2025-01-09 15:26:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:04,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789505532] [2025-01-09 15:26:04,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:04,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:04,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:04,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:04,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:04,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789505532] [2025-01-09 15:26:04,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789505532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:04,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:04,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:26:04,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231791246] [2025-01-09 15:26:04,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:04,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:04,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:04,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:04,980 INFO L87 Difference]: Start difference. First operand 764 states and 998 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:05,704 INFO L93 Difference]: Finished difference Result 1581 states and 2061 transitions. [2025-01-09 15:26:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:26:05,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-01-09 15:26:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:05,712 INFO L225 Difference]: With dead ends: 1581 [2025-01-09 15:26:05,712 INFO L226 Difference]: Without dead ends: 820 [2025-01-09 15:26:05,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:26:05,716 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 93 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:05,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1489 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:26:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-01-09 15:26:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 623. [2025-01-09 15:26:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 503 states have (on average 1.216699801192843) internal successors, (612), 509 states have internal predecessors, (612), 100 states have call successors, (100), 19 states have call predecessors, (100), 19 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 812 transitions. [2025-01-09 15:26:05,805 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 812 transitions. Word has length 150 [2025-01-09 15:26:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:05,805 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 812 transitions. [2025-01-09 15:26:05,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 812 transitions. [2025-01-09 15:26:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:05,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:05,808 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:05,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:26:05,808 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:05,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1964726569, now seen corresponding path program 1 times [2025-01-09 15:26:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160493542] [2025-01-09 15:26:05,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:05,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:05,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:05,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:05,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160493542] [2025-01-09 15:26:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160493542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:07,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:07,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:26:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567299372] [2025-01-09 15:26:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:07,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:26:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:07,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:26:07,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:26:07,090 INFO L87 Difference]: Start difference. First operand 623 states and 812 transitions. Second operand has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:26:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:07,924 INFO L93 Difference]: Finished difference Result 1431 states and 1866 transitions. [2025-01-09 15:26:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:26:07,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-01-09 15:26:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:07,932 INFO L225 Difference]: With dead ends: 1431 [2025-01-09 15:26:07,932 INFO L226 Difference]: Without dead ends: 811 [2025-01-09 15:26:07,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:26:07,936 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 96 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:07,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 969 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:26:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-01-09 15:26:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 648. [2025-01-09 15:26:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 528 states have (on average 1.2253787878787878) internal successors, (647), 534 states have internal predecessors, (647), 100 states have call successors, (100), 19 states have call predecessors, (100), 19 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 847 transitions. [2025-01-09 15:26:07,998 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 847 transitions. Word has length 150 [2025-01-09 15:26:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:08,000 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 847 transitions. [2025-01-09 15:26:08,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:26:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 847 transitions. [2025-01-09 15:26:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:08,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:08,002 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:08,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:26:08,003 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:08,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 336096021, now seen corresponding path program 1 times [2025-01-09 15:26:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003353827] [2025-01-09 15:26:08,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:08,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:08,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:08,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:08,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:08,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:08,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003353827] [2025-01-09 15:26:08,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003353827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:08,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:08,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:26:08,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536885093] [2025-01-09 15:26:08,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:26:08,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:08,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:26:08,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:26:08,525 INFO L87 Difference]: Start difference. First operand 648 states and 847 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:09,365 INFO L93 Difference]: Finished difference Result 1943 states and 2538 transitions. [2025-01-09 15:26:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:26:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:26:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:09,372 INFO L225 Difference]: With dead ends: 1943 [2025-01-09 15:26:09,372 INFO L226 Difference]: Without dead ends: 1298 [2025-01-09 15:26:09,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:26:09,374 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 175 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:09,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 689 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:26:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-01-09 15:26:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 684. [2025-01-09 15:26:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 564 states have (on average 1.2411347517730495) internal successors, (700), 570 states have internal predecessors, (700), 100 states have call successors, (100), 19 states have call predecessors, (100), 19 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 900 transitions. [2025-01-09 15:26:09,487 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 900 transitions. Word has length 150 [2025-01-09 15:26:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:09,488 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 900 transitions. [2025-01-09 15:26:09,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 900 transitions. [2025-01-09 15:26:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:09,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:09,491 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:09,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:26:09,491 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:09,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -943767657, now seen corresponding path program 1 times [2025-01-09 15:26:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170696982] [2025-01-09 15:26:09,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:09,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:09,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:09,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:09,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170696982] [2025-01-09 15:26:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170696982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:26:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677776063] [2025-01-09 15:26:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:26:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:10,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:26:10,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:26:10,210 INFO L87 Difference]: Start difference. First operand 684 states and 900 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:10,758 INFO L93 Difference]: Finished difference Result 1505 states and 1978 transitions. [2025-01-09 15:26:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:26:10,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-01-09 15:26:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:10,764 INFO L225 Difference]: With dead ends: 1505 [2025-01-09 15:26:10,764 INFO L226 Difference]: Without dead ends: 824 [2025-01-09 15:26:10,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:26:10,766 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 89 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:10,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1477 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:26:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-01-09 15:26:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 676. [2025-01-09 15:26:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 556 states have (on average 1.2374100719424461) internal successors, (688), 562 states have internal predecessors, (688), 100 states have call successors, (100), 19 states have call predecessors, (100), 19 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 888 transitions. [2025-01-09 15:26:10,834 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 888 transitions. Word has length 150 [2025-01-09 15:26:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:10,834 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 888 transitions. [2025-01-09 15:26:10,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 888 transitions. [2025-01-09 15:26:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:10,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:10,836 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:10,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:26:10,837 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1045400909, now seen corresponding path program 1 times [2025-01-09 15:26:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:10,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819453491] [2025-01-09 15:26:10,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:10,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:10,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:10,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819453491] [2025-01-09 15:26:12,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819453491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:12,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:12,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:26:12,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95546759] [2025-01-09 15:26:12,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:12,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:26:12,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:12,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:26:12,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:26:12,394 INFO L87 Difference]: Start difference. First operand 676 states and 888 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:13,329 INFO L93 Difference]: Finished difference Result 1598 states and 2105 transitions. [2025-01-09 15:26:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:26:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-01-09 15:26:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:13,334 INFO L225 Difference]: With dead ends: 1598 [2025-01-09 15:26:13,334 INFO L226 Difference]: Without dead ends: 925 [2025-01-09 15:26:13,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:26:13,336 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 96 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:13,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1488 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:26:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-01-09 15:26:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 709. [2025-01-09 15:26:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 589 states have (on average 1.2478777589134125) internal successors, (735), 595 states have internal predecessors, (735), 100 states have call successors, (100), 19 states have call predecessors, (100), 19 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 935 transitions. [2025-01-09 15:26:13,426 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 935 transitions. Word has length 150 [2025-01-09 15:26:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:13,426 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 935 transitions. [2025-01-09 15:26:13,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 935 transitions. [2025-01-09 15:26:13,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:13,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:13,428 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:13,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:26:13,428 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:13,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash 24332555, now seen corresponding path program 1 times [2025-01-09 15:26:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179331517] [2025-01-09 15:26:13,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:13,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:13,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:13,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:13,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:14,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:14,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179331517] [2025-01-09 15:26:14,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179331517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:14,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:14,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612561032] [2025-01-09 15:26:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:14,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:14,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:14,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:14,003 INFO L87 Difference]: Start difference. First operand 709 states and 935 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:14,459 INFO L93 Difference]: Finished difference Result 1695 states and 2241 transitions. [2025-01-09 15:26:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:14,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-01-09 15:26:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:14,465 INFO L225 Difference]: With dead ends: 1695 [2025-01-09 15:26:14,465 INFO L226 Difference]: Without dead ends: 989 [2025-01-09 15:26:14,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:26:14,467 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 94 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:14,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 979 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-01-09 15:26:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 943. [2025-01-09 15:26:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 786 states have (on average 1.2468193384223918) internal successors, (980), 795 states have internal predecessors, (980), 132 states have call successors, (132), 24 states have call predecessors, (132), 24 states have return successors, (132), 123 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 15:26:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1244 transitions. [2025-01-09 15:26:14,570 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1244 transitions. Word has length 150 [2025-01-09 15:26:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:14,571 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1244 transitions. [2025-01-09 15:26:14,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1244 transitions. [2025-01-09 15:26:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:14,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:14,574 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:14,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:26:14,574 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:14,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash 86372169, now seen corresponding path program 1 times [2025-01-09 15:26:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:14,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922678822] [2025-01-09 15:26:14,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:14,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:14,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:14,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:14,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922678822] [2025-01-09 15:26:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922678822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:14,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:14,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:26:14,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428774291] [2025-01-09 15:26:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:14,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:26:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:14,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:26:14,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:26:14,804 INFO L87 Difference]: Start difference. First operand 943 states and 1244 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:15,271 INFO L93 Difference]: Finished difference Result 2147 states and 2819 transitions. [2025-01-09 15:26:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:26:15,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:26:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:15,276 INFO L225 Difference]: With dead ends: 2147 [2025-01-09 15:26:15,277 INFO L226 Difference]: Without dead ends: 1207 [2025-01-09 15:26:15,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:26:15,279 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 104 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:15,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 587 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-01-09 15:26:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 920. [2025-01-09 15:26:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 763 states have (on average 1.238532110091743) internal successors, (945), 772 states have internal predecessors, (945), 132 states have call successors, (132), 24 states have call predecessors, (132), 24 states have return successors, (132), 123 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 15:26:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1209 transitions. [2025-01-09 15:26:15,396 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1209 transitions. Word has length 150 [2025-01-09 15:26:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:15,397 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1209 transitions. [2025-01-09 15:26:15,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1209 transitions. [2025-01-09 15:26:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:15,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:15,399 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:26:15,399 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -578523175, now seen corresponding path program 1 times [2025-01-09 15:26:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349472739] [2025-01-09 15:26:15,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:15,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:15,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349472739] [2025-01-09 15:26:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349472739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:16,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:16,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:26:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211651472] [2025-01-09 15:26:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:16,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:16,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:16,251 INFO L87 Difference]: Start difference. First operand 920 states and 1209 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:16,956 INFO L93 Difference]: Finished difference Result 2040 states and 2666 transitions. [2025-01-09 15:26:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:26:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-01-09 15:26:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:16,961 INFO L225 Difference]: With dead ends: 2040 [2025-01-09 15:26:16,961 INFO L226 Difference]: Without dead ends: 1117 [2025-01-09 15:26:16,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:26:16,963 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 243 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:16,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 733 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:26:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-01-09 15:26:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 731. [2025-01-09 15:26:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 610 states have (on average 1.2344262295081967) internal successors, (753), 616 states have internal predecessors, (753), 100 states have call successors, (100), 20 states have call predecessors, (100), 20 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 953 transitions. [2025-01-09 15:26:17,069 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 953 transitions. Word has length 150 [2025-01-09 15:26:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:17,069 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 953 transitions. [2025-01-09 15:26:17,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:26:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 953 transitions. [2025-01-09 15:26:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:17,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:17,071 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:17,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:26:17,072 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:17,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash 442435737, now seen corresponding path program 1 times [2025-01-09 15:26:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:17,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720654382] [2025-01-09 15:26:17,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:17,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720654382] [2025-01-09 15:26:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720654382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:26:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393681481] [2025-01-09 15:26:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:17,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:17,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:17,498 INFO L87 Difference]: Start difference. First operand 731 states and 953 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:17,937 INFO L93 Difference]: Finished difference Result 1601 states and 2087 transitions. [2025-01-09 15:26:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:26:17,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-01-09 15:26:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:17,941 INFO L225 Difference]: With dead ends: 1601 [2025-01-09 15:26:17,941 INFO L226 Difference]: Without dead ends: 873 [2025-01-09 15:26:17,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:26:17,942 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 95 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:17,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1103 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-01-09 15:26:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 729. [2025-01-09 15:26:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 608 states have (on average 1.231907894736842) internal successors, (749), 614 states have internal predecessors, (749), 100 states have call successors, (100), 20 states have call predecessors, (100), 20 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 949 transitions. [2025-01-09 15:26:18,047 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 949 transitions. Word has length 150 [2025-01-09 15:26:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:18,047 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 949 transitions. [2025-01-09 15:26:18,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 949 transitions. [2025-01-09 15:26:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:18,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:18,049 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:18,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:26:18,049 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:18,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -359668457, now seen corresponding path program 1 times [2025-01-09 15:26:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:18,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916174516] [2025-01-09 15:26:18,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:18,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:18,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:18,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:18,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:18,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916174516] [2025-01-09 15:26:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916174516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:18,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724838149] [2025-01-09 15:26:18,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:18,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:18,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:18,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:18,566 INFO L87 Difference]: Start difference. First operand 729 states and 949 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:18,980 INFO L93 Difference]: Finished difference Result 1550 states and 2010 transitions. [2025-01-09 15:26:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:26:18,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-01-09 15:26:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:18,985 INFO L225 Difference]: With dead ends: 1550 [2025-01-09 15:26:18,985 INFO L226 Difference]: Without dead ends: 802 [2025-01-09 15:26:18,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:18,987 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 175 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:18,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 617 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-01-09 15:26:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 694. [2025-01-09 15:26:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 573 states have (on average 1.2164048865619546) internal successors, (697), 579 states have internal predecessors, (697), 100 states have call successors, (100), 20 states have call predecessors, (100), 20 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:26:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 897 transitions. [2025-01-09 15:26:19,107 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 897 transitions. Word has length 150 [2025-01-09 15:26:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:19,108 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 897 transitions. [2025-01-09 15:26:19,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 897 transitions. [2025-01-09 15:26:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:19,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:19,109 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:19,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:26:19,110 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:19,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1472575563, now seen corresponding path program 1 times [2025-01-09 15:26:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267444006] [2025-01-09 15:26:19,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:19,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:19,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:19,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:19,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267444006] [2025-01-09 15:26:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267444006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:26:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031678905] [2025-01-09 15:26:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:26:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:19,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:26:19,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:19,520 INFO L87 Difference]: Start difference. First operand 694 states and 897 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:20,016 INFO L93 Difference]: Finished difference Result 1606 states and 2071 transitions. [2025-01-09 15:26:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:26:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-01-09 15:26:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:20,021 INFO L225 Difference]: With dead ends: 1606 [2025-01-09 15:26:20,021 INFO L226 Difference]: Without dead ends: 915 [2025-01-09 15:26:20,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:26:20,024 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 199 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:20,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1086 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-09 15:26:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 554. [2025-01-09 15:26:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 465 states have (on average 1.221505376344086) internal successors, (568), 469 states have internal predecessors, (568), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:26:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 712 transitions. [2025-01-09 15:26:20,137 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 712 transitions. Word has length 150 [2025-01-09 15:26:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:20,137 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 712 transitions. [2025-01-09 15:26:20,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 712 transitions. [2025-01-09 15:26:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:26:20,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:20,139 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:26:20,139 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash 654927113, now seen corresponding path program 1 times [2025-01-09 15:26:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99351967] [2025-01-09 15:26:20,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:20,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:26:20,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:26:20,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:20,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:20,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99351967] [2025-01-09 15:26:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99351967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:20,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:26:20,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150894782] [2025-01-09 15:26:20,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:20,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:26:20,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:20,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:26:20,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:26:20,505 INFO L87 Difference]: Start difference. First operand 554 states and 712 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:20,933 INFO L93 Difference]: Finished difference Result 1258 states and 1617 transitions. [2025-01-09 15:26:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:26:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-01-09 15:26:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:20,940 INFO L225 Difference]: With dead ends: 1258 [2025-01-09 15:26:20,940 INFO L226 Difference]: Without dead ends: 707 [2025-01-09 15:26:20,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:26:20,944 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 91 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:20,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 991 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-01-09 15:26:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 550. [2025-01-09 15:26:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 461 states have (on average 1.2190889370932756) internal successors, (562), 465 states have internal predecessors, (562), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:26:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 706 transitions. [2025-01-09 15:26:21,036 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 706 transitions. Word has length 150 [2025-01-09 15:26:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:21,036 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 706 transitions. [2025-01-09 15:26:21,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 706 transitions. [2025-01-09 15:26:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:26:21,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:21,037 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:21,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:26:21,038 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:21,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2079788693, now seen corresponding path program 1 times [2025-01-09 15:26:21,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:21,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853275954] [2025-01-09 15:26:21,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:21,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:26:21,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:26:21,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:21,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853275954] [2025-01-09 15:26:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853275954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:26:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217566732] [2025-01-09 15:26:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:21,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:26:21,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:21,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:26:21,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:26:21,237 INFO L87 Difference]: Start difference. First operand 550 states and 706 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:21,390 INFO L93 Difference]: Finished difference Result 1088 states and 1397 transitions. [2025-01-09 15:26:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:21,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:26:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:21,394 INFO L225 Difference]: With dead ends: 1088 [2025-01-09 15:26:21,394 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 15:26:21,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:26:21,396 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:21,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 811 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:26:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 15:26:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2025-01-09 15:26:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 446 states have (on average 1.2152466367713004) internal successors, (542), 450 states have internal predecessors, (542), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:26:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 686 transitions. [2025-01-09 15:26:21,484 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 686 transitions. Word has length 151 [2025-01-09 15:26:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:21,484 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 686 transitions. [2025-01-09 15:26:21,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 686 transitions. [2025-01-09 15:26:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:26:21,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:21,485 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:21,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:26:21,486 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:21,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash 787947139, now seen corresponding path program 1 times [2025-01-09 15:26:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835878313] [2025-01-09 15:26:21,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:21,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:21,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:26:21,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:26:21,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:21,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:21,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835878313] [2025-01-09 15:26:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835878313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:21,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:21,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:26:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412092914] [2025-01-09 15:26:21,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:21,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:26:21,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:21,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:26:21,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:26:21,676 INFO L87 Difference]: Start difference. First operand 535 states and 686 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:21,882 INFO L93 Difference]: Finished difference Result 1059 states and 1359 transitions. [2025-01-09 15:26:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:21,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:26:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:21,886 INFO L225 Difference]: With dead ends: 1059 [2025-01-09 15:26:21,886 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 15:26:21,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:26:21,887 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 117 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:21,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 542 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:26:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 15:26:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2025-01-09 15:26:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 436 states have (on average 1.213302752293578) internal successors, (529), 440 states have internal predecessors, (529), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:26:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 673 transitions. [2025-01-09 15:26:22,037 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 673 transitions. Word has length 151 [2025-01-09 15:26:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 673 transitions. [2025-01-09 15:26:22,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 673 transitions. [2025-01-09 15:26:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:26:22,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:22,039 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:22,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:26:22,039 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1160656832, now seen corresponding path program 1 times [2025-01-09 15:26:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155693743] [2025-01-09 15:26:22,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:22,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:22,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:22,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:22,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155693743] [2025-01-09 15:26:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155693743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:22,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:22,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:22,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104116461] [2025-01-09 15:26:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:22,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:22,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:22,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:22,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:22,818 INFO L87 Difference]: Start difference. First operand 525 states and 673 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:23,255 INFO L93 Difference]: Finished difference Result 598 states and 762 transitions. [2025-01-09 15:26:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:23,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-01-09 15:26:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:23,260 INFO L225 Difference]: With dead ends: 598 [2025-01-09 15:26:23,260 INFO L226 Difference]: Without dead ends: 596 [2025-01-09 15:26:23,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:23,260 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 91 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:23,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 941 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-01-09 15:26:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 561. [2025-01-09 15:26:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 465 states have (on average 1.2) internal successors, (558), 470 states have internal predecessors, (558), 76 states have call successors, (76), 19 states have call predecessors, (76), 19 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 15:26:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 710 transitions. [2025-01-09 15:26:23,362 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 710 transitions. Word has length 152 [2025-01-09 15:26:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:23,362 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 710 transitions. [2025-01-09 15:26:23,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 710 transitions. [2025-01-09 15:26:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:26:23,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:23,364 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:23,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:26:23,364 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:23,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1162503874, now seen corresponding path program 1 times [2025-01-09 15:26:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257521416] [2025-01-09 15:26:23,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:23,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:23,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:23,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257521416] [2025-01-09 15:26:23,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257521416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:23,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:23,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:26:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113629228] [2025-01-09 15:26:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:23,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:26:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:23,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:26:23,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:26:23,625 INFO L87 Difference]: Start difference. First operand 561 states and 710 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:23,781 INFO L93 Difference]: Finished difference Result 1080 states and 1362 transitions. [2025-01-09 15:26:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:26:23,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:26:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:23,784 INFO L225 Difference]: With dead ends: 1080 [2025-01-09 15:26:23,784 INFO L226 Difference]: Without dead ends: 573 [2025-01-09 15:26:23,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:23,785 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 69 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:23,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 572 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:26:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-01-09 15:26:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-01-09 15:26:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 474 states have (on average 1.1856540084388185) internal successors, (562), 479 states have internal predecessors, (562), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 15:26:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 714 transitions. [2025-01-09 15:26:23,880 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 714 transitions. Word has length 152 [2025-01-09 15:26:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:23,881 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 714 transitions. [2025-01-09 15:26:23,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 714 transitions. [2025-01-09 15:26:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:26:23,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:23,882 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:23,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 15:26:23,882 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:23,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:23,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1357456060, now seen corresponding path program 1 times [2025-01-09 15:26:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:23,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351024003] [2025-01-09 15:26:23,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:23,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:23,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:23,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:26:24,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351024003] [2025-01-09 15:26:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351024003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:26:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145840128] [2025-01-09 15:26:24,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:24,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:26:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:26:24,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:26:24,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:26:24,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:24,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:26:24,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:24,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145840128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:26:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:26:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799121391] [2025-01-09 15:26:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:24,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:26:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:24,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:26:24,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:24,299 INFO L87 Difference]: Start difference. First operand 573 states and 714 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:24,511 INFO L93 Difference]: Finished difference Result 1107 states and 1381 transitions. [2025-01-09 15:26:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:26:24,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:26:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:24,515 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 15:26:24,515 INFO L226 Difference]: Without dead ends: 588 [2025-01-09 15:26:24,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:24,517 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:24,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 548 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:26:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-01-09 15:26:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-01-09 15:26:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 489 states have (on average 1.179959100204499) internal successors, (577), 494 states have internal predecessors, (577), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 15:26:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 729 transitions. [2025-01-09 15:26:24,658 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 729 transitions. Word has length 152 [2025-01-09 15:26:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:24,659 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 729 transitions. [2025-01-09 15:26:24,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 729 transitions. [2025-01-09 15:26:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:26:24,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:24,660 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:24,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:26:24,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 15:26:24,861 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:24,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -361665966, now seen corresponding path program 1 times [2025-01-09 15:26:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:24,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375003528] [2025-01-09 15:26:24,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:24,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:24,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:25,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:25,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375003528] [2025-01-09 15:26:25,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375003528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:25,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:25,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:26:25,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863279970] [2025-01-09 15:26:25,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:25,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:26:25,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:25,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:26:25,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:26:25,761 INFO L87 Difference]: Start difference. First operand 588 states and 729 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:26,558 INFO L93 Difference]: Finished difference Result 1302 states and 1610 transitions. [2025-01-09 15:26:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:26:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-01-09 15:26:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:26,562 INFO L225 Difference]: With dead ends: 1302 [2025-01-09 15:26:26,562 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 15:26:26,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:26:26,563 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:26,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1161 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:26:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 15:26:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 596. [2025-01-09 15:26:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 497 states have (on average 1.1810865191146882) internal successors, (587), 502 states have internal predecessors, (587), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 15:26:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 739 transitions. [2025-01-09 15:26:26,673 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 739 transitions. Word has length 152 [2025-01-09 15:26:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:26,673 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 739 transitions. [2025-01-09 15:26:26,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 739 transitions. [2025-01-09 15:26:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:26:26,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:26,674 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:26,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 15:26:26,675 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:26,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1641529644, now seen corresponding path program 1 times [2025-01-09 15:26:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:26,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274347363] [2025-01-09 15:26:26,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:26,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:26,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:26,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:26,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:26,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274347363] [2025-01-09 15:26:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274347363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:27,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:26:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072062257] [2025-01-09 15:26:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:26:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:27,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:26:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:26:27,013 INFO L87 Difference]: Start difference. First operand 596 states and 739 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:27,384 INFO L93 Difference]: Finished difference Result 1298 states and 1602 transitions. [2025-01-09 15:26:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:26:27,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:26:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:27,388 INFO L225 Difference]: With dead ends: 1298 [2025-01-09 15:26:27,388 INFO L226 Difference]: Without dead ends: 756 [2025-01-09 15:26:27,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:27,389 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 81 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:27,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 754 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:26:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-01-09 15:26:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 596. [2025-01-09 15:26:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 497 states have (on average 1.1770623742454729) internal successors, (585), 502 states have internal predecessors, (585), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 15:26:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 737 transitions. [2025-01-09 15:26:27,476 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 737 transitions. Word has length 152 [2025-01-09 15:26:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 737 transitions. [2025-01-09 15:26:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 737 transitions. [2025-01-09 15:26:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:26:27,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:27,477 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:27,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 15:26:27,477 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:27,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 851419730, now seen corresponding path program 1 times [2025-01-09 15:26:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439655650] [2025-01-09 15:26:27,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:27,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:27,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:27,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:27,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:27,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439655650] [2025-01-09 15:26:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439655650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:27,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:27,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:26:27,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740706792] [2025-01-09 15:26:27,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:26:27,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:27,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:26:27,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:27,808 INFO L87 Difference]: Start difference. First operand 596 states and 737 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:28,359 INFO L93 Difference]: Finished difference Result 1336 states and 1647 transitions. [2025-01-09 15:26:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:26:28,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:26:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:28,371 INFO L225 Difference]: With dead ends: 1336 [2025-01-09 15:26:28,371 INFO L226 Difference]: Without dead ends: 794 [2025-01-09 15:26:28,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:26:28,373 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 117 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:28,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1949 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-01-09 15:26:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 691. [2025-01-09 15:26:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 567 states have (on average 1.162257495590829) internal successors, (659), 573 states have internal predecessors, (659), 95 states have call successors, (95), 28 states have call predecessors, (95), 28 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:26:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 849 transitions. [2025-01-09 15:26:28,526 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 849 transitions. Word has length 152 [2025-01-09 15:26:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 849 transitions. [2025-01-09 15:26:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 849 transitions. [2025-01-09 15:26:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:26:28,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:28,528 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:28,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 15:26:28,528 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:28,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1944829170, now seen corresponding path program 1 times [2025-01-09 15:26:28,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:28,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125348284] [2025-01-09 15:26:28,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:28,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:26:28,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:26:28,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:28,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125348284] [2025-01-09 15:26:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125348284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:29,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:29,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:26:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112401962] [2025-01-09 15:26:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:29,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:29,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:29,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:29,383 INFO L87 Difference]: Start difference. First operand 691 states and 849 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:30,412 INFO L93 Difference]: Finished difference Result 1781 states and 2163 transitions. [2025-01-09 15:26:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:26:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-01-09 15:26:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:30,417 INFO L225 Difference]: With dead ends: 1781 [2025-01-09 15:26:30,417 INFO L226 Difference]: Without dead ends: 1144 [2025-01-09 15:26:30,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:26:30,418 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 160 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:30,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 824 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:26:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-01-09 15:26:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 689. [2025-01-09 15:26:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 565 states have (on average 1.1592920353982301) internal successors, (655), 571 states have internal predecessors, (655), 95 states have call successors, (95), 28 states have call predecessors, (95), 28 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:26:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 845 transitions. [2025-01-09 15:26:30,557 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 845 transitions. Word has length 152 [2025-01-09 15:26:30,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:30,557 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 845 transitions. [2025-01-09 15:26:30,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 845 transitions. [2025-01-09 15:26:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:26:30,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:30,558 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:30,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 15:26:30,558 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:30,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1978746750, now seen corresponding path program 1 times [2025-01-09 15:26:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:30,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445577008] [2025-01-09 15:26:30,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:30,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:26:30,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:26:30,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:30,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445577008] [2025-01-09 15:26:30,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445577008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:30,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:30,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:26:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480053153] [2025-01-09 15:26:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:30,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:26:30,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:30,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:26:30,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:30,993 INFO L87 Difference]: Start difference. First operand 689 states and 845 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:31,602 INFO L93 Difference]: Finished difference Result 1472 states and 1799 transitions. [2025-01-09 15:26:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:26:31,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:26:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:31,611 INFO L225 Difference]: With dead ends: 1472 [2025-01-09 15:26:31,611 INFO L226 Difference]: Without dead ends: 837 [2025-01-09 15:26:31,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:31,613 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 83 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:31,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 636 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-01-09 15:26:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 665. [2025-01-09 15:26:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 541 states have (on average 1.1571164510166358) internal successors, (626), 547 states have internal predecessors, (626), 95 states have call successors, (95), 28 states have call predecessors, (95), 28 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:26:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 816 transitions. [2025-01-09 15:26:31,749 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 816 transitions. Word has length 153 [2025-01-09 15:26:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:31,749 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 816 transitions. [2025-01-09 15:26:31,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 816 transitions. [2025-01-09 15:26:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:26:31,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:31,751 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:31,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 15:26:31,751 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:31,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash 706504841, now seen corresponding path program 1 times [2025-01-09 15:26:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:31,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548771209] [2025-01-09 15:26:31,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:31,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:26:31,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:26:31,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:31,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548771209] [2025-01-09 15:26:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548771209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402432306] [2025-01-09 15:26:32,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:32,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:32,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:32,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:32,157 INFO L87 Difference]: Start difference. First operand 665 states and 816 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:32,877 INFO L93 Difference]: Finished difference Result 1744 states and 2129 transitions. [2025-01-09 15:26:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-01-09 15:26:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:32,883 INFO L225 Difference]: With dead ends: 1744 [2025-01-09 15:26:32,883 INFO L226 Difference]: Without dead ends: 1133 [2025-01-09 15:26:32,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:32,885 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 84 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:32,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 578 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-01-09 15:26:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 817. [2025-01-09 15:26:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 693 states have (on average 1.155844155844156) internal successors, (801), 699 states have internal predecessors, (801), 95 states have call successors, (95), 28 states have call predecessors, (95), 28 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:26:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 991 transitions. [2025-01-09 15:26:33,037 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 991 transitions. Word has length 154 [2025-01-09 15:26:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:33,038 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 991 transitions. [2025-01-09 15:26:33,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 991 transitions. [2025-01-09 15:26:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:26:33,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:33,039 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:33,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 15:26:33,039 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 119698827, now seen corresponding path program 1 times [2025-01-09 15:26:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661390829] [2025-01-09 15:26:33,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:33,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:26:33,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:26:33,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:33,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661390829] [2025-01-09 15:26:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661390829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359444496] [2025-01-09 15:26:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:33,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:33,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:33,699 INFO L87 Difference]: Start difference. First operand 817 states and 991 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:34,326 INFO L93 Difference]: Finished difference Result 1818 states and 2195 transitions. [2025-01-09 15:26:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:34,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-01-09 15:26:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:34,332 INFO L225 Difference]: With dead ends: 1818 [2025-01-09 15:26:34,333 INFO L226 Difference]: Without dead ends: 1055 [2025-01-09 15:26:34,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:34,335 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 68 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:34,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 823 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-01-09 15:26:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1045. [2025-01-09 15:26:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 853 states have (on average 1.126611957796014) internal successors, (961), 865 states have internal predecessors, (961), 147 states have call successors, (147), 44 states have call predecessors, (147), 44 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-01-09 15:26:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1255 transitions. [2025-01-09 15:26:34,624 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1255 transitions. Word has length 154 [2025-01-09 15:26:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:34,625 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1255 transitions. [2025-01-09 15:26:34,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:26:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1255 transitions. [2025-01-09 15:26:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:26:34,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:34,626 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:34,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 15:26:34,626 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash 197031751, now seen corresponding path program 1 times [2025-01-09 15:26:34,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:34,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459080679] [2025-01-09 15:26:34,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:34,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:26:34,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:26:34,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:34,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459080679] [2025-01-09 15:26:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459080679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:35,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:35,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198405909] [2025-01-09 15:26:35,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:35,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:35,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:35,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:35,054 INFO L87 Difference]: Start difference. First operand 1045 states and 1255 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:35,724 INFO L93 Difference]: Finished difference Result 2497 states and 2987 transitions. [2025-01-09 15:26:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:26:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:35,731 INFO L225 Difference]: With dead ends: 2497 [2025-01-09 15:26:35,731 INFO L226 Difference]: Without dead ends: 1506 [2025-01-09 15:26:35,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:35,733 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 84 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:35,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 586 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:26:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-09 15:26:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1184. [2025-01-09 15:26:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 992 states have (on average 1.1189516129032258) internal successors, (1110), 1004 states have internal predecessors, (1110), 147 states have call successors, (147), 44 states have call predecessors, (147), 44 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-01-09 15:26:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1404 transitions. [2025-01-09 15:26:35,974 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1404 transitions. Word has length 154 [2025-01-09 15:26:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:35,974 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1404 transitions. [2025-01-09 15:26:35,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1404 transitions. [2025-01-09 15:26:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:26:35,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:35,975 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:35,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 15:26:35,975 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash -389774263, now seen corresponding path program 1 times [2025-01-09 15:26:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837954527] [2025-01-09 15:26:35,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:35,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:26:36,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:26:36,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:36,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:36,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837954527] [2025-01-09 15:26:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837954527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:26:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397534233] [2025-01-09 15:26:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:36,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:26:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:36,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:26:36,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:36,312 INFO L87 Difference]: Start difference. First operand 1184 states and 1404 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:36,955 INFO L93 Difference]: Finished difference Result 2552 states and 3021 transitions. [2025-01-09 15:26:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:26:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:26:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:36,962 INFO L225 Difference]: With dead ends: 2552 [2025-01-09 15:26:36,962 INFO L226 Difference]: Without dead ends: 1422 [2025-01-09 15:26:36,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:26:36,965 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 68 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:36,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 874 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-01-09 15:26:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1032. [2025-01-09 15:26:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 840 states have (on average 1.1130952380952381) internal successors, (935), 852 states have internal predecessors, (935), 147 states have call successors, (147), 44 states have call predecessors, (147), 44 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-01-09 15:26:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1229 transitions. [2025-01-09 15:26:37,294 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1229 transitions. Word has length 154 [2025-01-09 15:26:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:37,295 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1229 transitions. [2025-01-09 15:26:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1229 transitions. [2025-01-09 15:26:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:26:37,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:37,296 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:37,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 15:26:37,297 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:37,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1528609333, now seen corresponding path program 1 times [2025-01-09 15:26:37,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:37,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179025287] [2025-01-09 15:26:37,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:37,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:26:37,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:26:37,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:37,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179025287] [2025-01-09 15:26:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179025287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:37,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:26:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081012637] [2025-01-09 15:26:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:26:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:37,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:26:37,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:37,634 INFO L87 Difference]: Start difference. First operand 1032 states and 1229 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:38,180 INFO L93 Difference]: Finished difference Result 2980 states and 3546 transitions. [2025-01-09 15:26:38,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:26:38,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:26:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:38,184 INFO L225 Difference]: With dead ends: 2980 [2025-01-09 15:26:38,184 INFO L226 Difference]: Without dead ends: 1056 [2025-01-09 15:26:38,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:38,187 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 117 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:38,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1398 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:26:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-01-09 15:26:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1038. [2025-01-09 15:26:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 846 states have (on average 1.0969267139479906) internal successors, (928), 858 states have internal predecessors, (928), 147 states have call successors, (147), 44 states have call predecessors, (147), 44 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-01-09 15:26:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1222 transitions. [2025-01-09 15:26:38,427 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1222 transitions. Word has length 155 [2025-01-09 15:26:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:38,428 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1222 transitions. [2025-01-09 15:26:38,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1222 transitions. [2025-01-09 15:26:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:26:38,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:38,430 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:38,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 15:26:38,430 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:38,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -843129929, now seen corresponding path program 1 times [2025-01-09 15:26:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65010212] [2025-01-09 15:26:38,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:38,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:26:38,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:26:38,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:38,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:26:38,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206717169] [2025-01-09 15:26:38,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:26:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:26:38,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:26:38,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:26:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:26:39,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:26:39,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:39,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:39,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 15:26:39,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:39,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 15:26:39,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:26:39,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-01-09 15:26:39,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2025-01-09 15:26:39,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-01-09 15:26:39,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:39,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 54 [2025-01-09 15:26:39,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:39,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 36 [2025-01-09 15:26:39,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2025-01-09 15:26:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:26:39,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:39,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:39,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65010212] [2025-01-09 15:26:39,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:26:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206717169] [2025-01-09 15:26:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206717169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:39,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:39,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:26:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812020246] [2025-01-09 15:26:39,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:39,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:26:39,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:39,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:26:39,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:39,843 INFO L87 Difference]: Start difference. First operand 1038 states and 1222 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:26:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:41,379 INFO L93 Difference]: Finished difference Result 2197 states and 2584 transitions. [2025-01-09 15:26:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:26:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:26:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:41,385 INFO L225 Difference]: With dead ends: 2197 [2025-01-09 15:26:41,385 INFO L226 Difference]: Without dead ends: 1213 [2025-01-09 15:26:41,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:41,387 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:41,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 611 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:26:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states.