./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/product-lines/email_spec27_product13.cil.c -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 102266cd9873aec631509424dd889c2e48b781667738cfaa50930481a41b1570 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:42:28,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:42:28,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:42:28,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:42:28,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:42:28,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:42:28,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:42:28,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:42:28,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:42:28,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:42:28,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:42:28,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:42:28,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:42:28,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:42:28,976 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:42:28,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:42:28,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:42:28,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:42:28,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:42:28,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:42:28,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:42:28,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:42:28,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:42:28,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:42:28,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:42:28,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:42:28,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:42:28,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:42:28,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:42:28,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:42:28,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:42:28,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:42:28,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:42:28,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:42:28,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:42:28,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:42:28,980 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 -> 102266cd9873aec631509424dd889c2e48b781667738cfaa50930481a41b1570 [2025-02-05 15:42:29,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:42:29,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:42:29,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:42:29,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:42:29,331 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:42:29,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2025-02-05 15:42:30,793 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/603fd4800/140e1750030e40ed8d3860ed9d32ddd8/FLAG840965e10 [2025-02-05 15:42:31,238 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:42:31,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2025-02-05 15:42:31,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/603fd4800/140e1750030e40ed8d3860ed9d32ddd8/FLAG840965e10 [2025-02-05 15:42:31,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/603fd4800/140e1750030e40ed8d3860ed9d32ddd8 [2025-02-05 15:42:31,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:42:31,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:42:31,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:31,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:42:31,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:42:31,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:31" (1/1) ... [2025-02-05 15:42:31,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407a6271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:31, skipping insertion in model container [2025-02-05 15:42:31,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:31" (1/1) ... [2025-02-05 15:42:31,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:42:31,993 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/product-lines/email_spec27_product13.cil.c[61687,61700] [2025-02-05 15:42:31,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:32,015 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:42:32,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-02-05 15:42:32,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [66] [2025-02-05 15:42:32,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] [2025-02-05 15:42:32,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [481] [2025-02-05 15:42:32,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [588] [2025-02-05 15:42:32,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [855] [2025-02-05 15:42:32,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1930] [2025-02-05 15:42:32,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2204] [2025-02-05 15:42:32,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2236] [2025-02-05 15:42:32,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2637] [2025-02-05 15:42:32,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2850] [2025-02-05 15:42:32,123 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/product-lines/email_spec27_product13.cil.c[61687,61700] [2025-02-05 15:42:32,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:32,155 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:42:32,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32 WrapperNode [2025-02-05 15:42:32,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:32,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:42:32,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:42:32,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:42:32,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,260 INFO L138 Inliner]: procedures = 124, calls = 178, calls flagged for inlining = 52, calls inlined = 44, statements flattened = 822 [2025-02-05 15:42:32,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:42:32,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:42:32,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:42:32,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:42:32,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,330 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:42:32,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:42:32,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:42:32,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:42:32,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:42:32,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (1/1) ... [2025-02-05 15:42:32,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:42:32,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:32,402 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-02-05 15:42:32,406 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-02-05 15:42:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:42:32,432 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:42:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:42:32,432 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:42:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:42:32,432 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:42:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:42:32,432 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:42:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:42:32,433 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:42:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:42:32,433 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:42:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:42:32,433 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:42:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:42:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:42:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:42:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:42:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:42:32,435 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:42:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:42:32,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:42:32,649 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:42:32,652 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:42:32,699 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: #res := ~retValue_acc~41; [2025-02-05 15:42:32,909 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1472-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~23#1; [2025-02-05 15:42:32,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-1: getClientId_#res#1 := getClientId_~retValue_acc~30#1; [2025-02-05 15:42:32,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L773-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~13#1; [2025-02-05 15:42:32,925 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544: #res := ~retValue_acc~40; [2025-02-05 15:42:32,957 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618: #res := ~retValue_acc~42; [2025-02-05 15:42:32,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2355: #res := ~retValue_acc~35; [2025-02-05 15:42:33,053 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1564: #res#1 := ~retValue_acc~25#1; [2025-02-05 15:42:33,053 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1519-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~24#1; [2025-02-05 15:42:33,088 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1788: #res := ~retValue_acc~28; [2025-02-05 15:42:33,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L585-1: createEmail_#res#1 := createEmail_~retValue_acc~8#1; [2025-02-05 15:42:33,417 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~10#1; [2025-02-05 15:42:33,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~11#1; [2025-02-05 15:42:33,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~12#1; [2025-02-05 15:42:33,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L478-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-02-05 15:42:33,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1734-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~27#1; [2025-02-05 15:42:33,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~26#1; [2025-02-05 15:42:33,426 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2318: #res := ~retValue_acc~34; [2025-02-05 15:42:33,429 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: #res := ~retValue_acc~6; [2025-02-05 15:42:33,548 INFO L? ?]: Removed 368 outVars from TransFormulas that were not future-live. [2025-02-05 15:42:33,549 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:42:33,565 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:42:33,566 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:42:33,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:42:33 BoogieIcfgContainer [2025-02-05 15:42:33,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:42:33,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:42:33,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:42:33,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:42:33,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:42:31" (1/3) ... [2025-02-05 15:42:33,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c69093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:42:33, skipping insertion in model container [2025-02-05 15:42:33,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:32" (2/3) ... [2025-02-05 15:42:33,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c69093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:42:33, skipping insertion in model container [2025-02-05 15:42:33,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:42:33" (3/3) ... [2025-02-05 15:42:33,576 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product13.cil.c [2025-02-05 15:42:33,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:42:33,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product13.cil.c that has 18 procedures, 277 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:42:33,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:42:33,682 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;@42d5ba4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:42:33,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:42:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 277 states, 220 states have (on average 1.5454545454545454) internal successors, (340), 222 states have internal predecessors, (340), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 15:42:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:42:33,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:33,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:33,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:33,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2033947722, now seen corresponding path program 1 times [2025-02-05 15:42:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:33,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940996991] [2025-02-05 15:42:33,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:33,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:42:33,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:42:33,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:33,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:42:34,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:34,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940996991] [2025-02-05 15:42:34,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940996991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:34,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485922191] [2025-02-05 15:42:34,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:34,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:34,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:34,547 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-02-05 15:42:34,550 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-02-05 15:42:34,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:42:34,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:42:34,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:34,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:34,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:42:34,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:42:34,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:34,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485922191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:34,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:34,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:42:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059099079] [2025-02-05 15:42:34,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:34,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:42:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:35,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:42:35,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:35,008 INFO L87 Difference]: Start difference. First operand has 277 states, 220 states have (on average 1.5454545454545454) internal successors, (340), 222 states have internal predecessors, (340), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:35,045 INFO L93 Difference]: Finished difference Result 406 states and 596 transitions. [2025-02-05 15:42:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:42:35,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2025-02-05 15:42:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:35,057 INFO L225 Difference]: With dead ends: 406 [2025-02-05 15:42:35,057 INFO L226 Difference]: Without dead ends: 270 [2025-02-05 15:42:35,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:35,063 INFO L435 NwaCegarLoop]: 413 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, 413 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-02-05 15:42:35,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-05 15:42:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-02-05 15:42:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.5420560747663552) internal successors, (330), 215 states have internal predecessors, (330), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 15:42:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 405 transitions. [2025-02-05 15:42:35,119 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 405 transitions. Word has length 105 [2025-02-05 15:42:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:35,120 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 405 transitions. [2025-02-05 15:42:35,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 405 transitions. [2025-02-05 15:42:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:42:35,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:35,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:35,144 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-02-05 15:42:35,336 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-02-05 15:42:35,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:35,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2089512360, now seen corresponding path program 1 times [2025-02-05 15:42:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:35,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080862727] [2025-02-05 15:42:35,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:35,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:42:35,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:42:35,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:35,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:42:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080862727] [2025-02-05 15:42:35,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080862727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:35,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571027192] [2025-02-05 15:42:35,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:35,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:35,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:35,677 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-02-05 15:42:35,680 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-02-05 15:42:35,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:42:36,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:42:36,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:36,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:36,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:42:36,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:42:36,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571027192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:36,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:42:36,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955056834] [2025-02-05 15:42:36,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:36,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:36,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:36,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:36,113 INFO L87 Difference]: Start difference. First operand 270 states and 405 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:36,169 INFO L93 Difference]: Finished difference Result 395 states and 577 transitions. [2025-02-05 15:42:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:36,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 106 [2025-02-05 15:42:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:36,175 INFO L225 Difference]: With dead ends: 395 [2025-02-05 15:42:36,175 INFO L226 Difference]: Without dead ends: 272 [2025-02-05 15:42:36,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:36,181 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 0 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:36,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 806 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-05 15:42:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-02-05 15:42:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 216 states have (on average 1.537037037037037) internal successors, (332), 217 states have internal predecessors, (332), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 15:42:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 407 transitions. [2025-02-05 15:42:36,203 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 407 transitions. Word has length 106 [2025-02-05 15:42:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 407 transitions. [2025-02-05 15:42:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 407 transitions. [2025-02-05 15:42:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:42:36,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:36,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:36,218 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-02-05 15:42:36,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:36,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:36,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1458594133, now seen corresponding path program 1 times [2025-02-05 15:42:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232209291] [2025-02-05 15:42:36,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:36,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:42:36,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:42:36,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:36,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:42:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:36,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232209291] [2025-02-05 15:42:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232209291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:36,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48389230] [2025-02-05 15:42:36,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:36,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:36,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:36,690 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-02-05 15:42:36,693 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-02-05 15:42:36,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:42:36,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:42:36,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:36,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:37,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:42:37,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:42:37,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48389230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:42:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423955821] [2025-02-05 15:42:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:37,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:37,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:37,037 INFO L87 Difference]: Start difference. First operand 272 states and 407 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:37,077 INFO L93 Difference]: Finished difference Result 568 states and 864 transitions. [2025-02-05 15:42:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:37,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-02-05 15:42:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:37,084 INFO L225 Difference]: With dead ends: 568 [2025-02-05 15:42:37,084 INFO L226 Difference]: Without dead ends: 323 [2025-02-05 15:42:37,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:37,088 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 99 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:37,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 782 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-05 15:42:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 315. [2025-02-05 15:42:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 248 states have (on average 1.5524193548387097) internal successors, (385), 249 states have internal predecessors, (385), 49 states have call successors, (49), 17 states have call predecessors, (49), 17 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 15:42:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 482 transitions. [2025-02-05 15:42:37,128 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 482 transitions. Word has length 111 [2025-02-05 15:42:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:37,130 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 482 transitions. [2025-02-05 15:42:37,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 482 transitions. [2025-02-05 15:42:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:42:37,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:37,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:37,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:42:37,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:37,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:37,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1915361197, now seen corresponding path program 1 times [2025-02-05 15:42:37,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:37,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867259635] [2025-02-05 15:42:37,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:37,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:37,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:42:37,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:42:37,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:37,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:42:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867259635] [2025-02-05 15:42:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867259635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464918190] [2025-02-05 15:42:37,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:37,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:37,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:37,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:42:37,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:42:37,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:42:37,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:42:37,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:37,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:37,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:42:37,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:42:37,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464918190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:42:37,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879935454] [2025-02-05 15:42:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:37,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:37,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:37,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:37,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:42:37,968 INFO L87 Difference]: Start difference. First operand 315 states and 482 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:42:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:38,043 INFO L93 Difference]: Finished difference Result 621 states and 954 transitions. [2025-02-05 15:42:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-02-05 15:42:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:38,049 INFO L225 Difference]: With dead ends: 621 [2025-02-05 15:42:38,049 INFO L226 Difference]: Without dead ends: 317 [2025-02-05 15:42:38,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:42:38,053 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 2 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:38,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1577 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-05 15:42:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-02-05 15:42:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 249 states have (on average 1.5502008032128514) internal successors, (386), 251 states have internal predecessors, (386), 49 states have call successors, (49), 17 states have call predecessors, (49), 18 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2025-02-05 15:42:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 485 transitions. [2025-02-05 15:42:38,087 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 485 transitions. Word has length 112 [2025-02-05 15:42:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:38,088 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 485 transitions. [2025-02-05 15:42:38,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:42:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 485 transitions. [2025-02-05 15:42:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:42:38,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:38,091 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:38,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:42:38,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:38,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:38,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1324397565, now seen corresponding path program 1 times [2025-02-05 15:42:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:38,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078842168] [2025-02-05 15:42:38,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:38,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:42:38,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:42:38,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:38,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:42:38,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078842168] [2025-02-05 15:42:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078842168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54302194] [2025-02-05 15:42:38,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:38,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:42:38,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:42:38,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:42:38,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:42:38,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:38,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:38,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:42:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:42:38,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:38,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54302194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:38,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:38,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:42:38,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570239726] [2025-02-05 15:42:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:38,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:38,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:38,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:42:38,865 INFO L87 Difference]: Start difference. First operand 317 states and 485 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:42:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:38,959 INFO L93 Difference]: Finished difference Result 623 states and 959 transitions. [2025-02-05 15:42:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:38,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-02-05 15:42:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:38,963 INFO L225 Difference]: With dead ends: 623 [2025-02-05 15:42:38,963 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 15:42:38,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:42:38,967 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 2 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:38,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1563 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 15:42:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-05 15:42:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 250 states have (on average 1.548) internal successors, (387), 253 states have internal predecessors, (387), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2025-02-05 15:42:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 491 transitions. [2025-02-05 15:42:38,989 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 491 transitions. Word has length 113 [2025-02-05 15:42:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:38,989 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 491 transitions. [2025-02-05 15:42:38,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:42:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 491 transitions. [2025-02-05 15:42:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:42:38,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:38,992 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:39,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:42:39,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:39,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:39,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash -402618308, now seen corresponding path program 1 times [2025-02-05 15:42:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388273178] [2025-02-05 15:42:39,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:39,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:42:39,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:42:39,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:39,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:42:39,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388273178] [2025-02-05 15:42:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388273178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:39,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:42:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506605612] [2025-02-05 15:42:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:39,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:39,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:39,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:39,374 INFO L87 Difference]: Start difference. First operand 319 states and 491 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:42:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:39,418 INFO L93 Difference]: Finished difference Result 615 states and 950 transitions. [2025-02-05 15:42:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:39,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-02-05 15:42:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:39,422 INFO L225 Difference]: With dead ends: 615 [2025-02-05 15:42:39,422 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 15:42:39,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:39,424 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 2 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:39,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1581 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 15:42:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-05 15:42:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 250 states have (on average 1.548) internal successors, (387), 253 states have internal predecessors, (387), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2025-02-05 15:42:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 490 transitions. [2025-02-05 15:42:39,440 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 490 transitions. Word has length 114 [2025-02-05 15:42:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:39,440 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 490 transitions. [2025-02-05 15:42:39,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:42:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 490 transitions. [2025-02-05 15:42:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:42:39,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:39,443 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:39,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:42:39,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:39,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash -78236496, now seen corresponding path program 2 times [2025-02-05 15:42:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:39,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267516157] [2025-02-05 15:42:39,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:42:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:39,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-02-05 15:42:39,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 115 statements. [2025-02-05 15:42:39,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:42:39,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:42:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267516157] [2025-02-05 15:42:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267516157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:42:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072183960] [2025-02-05 15:42:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:39,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:42:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:39,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:42:39,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:39,595 INFO L87 Difference]: Start difference. First operand 319 states and 490 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:39,637 INFO L93 Difference]: Finished difference Result 432 states and 646 transitions. [2025-02-05 15:42:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:42:39,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-02-05 15:42:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:39,641 INFO L225 Difference]: With dead ends: 432 [2025-02-05 15:42:39,641 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 15:42:39,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:39,642 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 0 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2391 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-02-05 15:42:39,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2391 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 15:42:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-05 15:42:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 250 states have (on average 1.544) internal successors, (386), 253 states have internal predecessors, (386), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2025-02-05 15:42:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 489 transitions. [2025-02-05 15:42:39,659 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 489 transitions. Word has length 115 [2025-02-05 15:42:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:39,659 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 489 transitions. [2025-02-05 15:42:39,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:42:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 489 transitions. [2025-02-05 15:42:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:42:39,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:39,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:39,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:42:39,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:39,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1142558985, now seen corresponding path program 1 times [2025-02-05 15:42:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:39,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445827399] [2025-02-05 15:42:39,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:39,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:42:39,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:42:39,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:39,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:42:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:39,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445827399] [2025-02-05 15:42:39,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445827399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:39,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:39,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:42:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047777711] [2025-02-05 15:42:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:39,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:39,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:39,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:39,851 INFO L87 Difference]: Start difference. First operand 319 states and 489 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:39,900 INFO L93 Difference]: Finished difference Result 617 states and 951 transitions. [2025-02-05 15:42:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-02-05 15:42:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:39,904 INFO L225 Difference]: With dead ends: 617 [2025-02-05 15:42:39,904 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 15:42:39,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:39,906 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:39,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1580 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 15:42:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-02-05 15:42:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 251 states have (on average 1.5418326693227091) internal successors, (387), 255 states have internal predecessors, (387), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2025-02-05 15:42:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 492 transitions. [2025-02-05 15:42:39,938 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 492 transitions. Word has length 122 [2025-02-05 15:42:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:39,939 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 492 transitions. [2025-02-05 15:42:39,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 492 transitions. [2025-02-05 15:42:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:42:39,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:39,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:39,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:42:39,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:39,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash 97971456, now seen corresponding path program 1 times [2025-02-05 15:42:39,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:39,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250090192] [2025-02-05 15:42:39,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:39,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:42:39,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:42:39,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:39,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:42:40,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:40,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250090192] [2025-02-05 15:42:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250090192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:42:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502579831] [2025-02-05 15:42:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:40,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:42:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:40,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:42:40,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:42:40,140 INFO L87 Difference]: Start difference. First operand 321 states and 492 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:42:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:40,286 INFO L93 Difference]: Finished difference Result 619 states and 950 transitions. [2025-02-05 15:42:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:42:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-02-05 15:42:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:40,292 INFO L225 Difference]: With dead ends: 619 [2025-02-05 15:42:40,292 INFO L226 Difference]: Without dead ends: 323 [2025-02-05 15:42:40,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:42:40,294 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 7 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:40,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2687 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:42:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-05 15:42:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-02-05 15:42:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 253 states have (on average 1.5375494071146245) internal successors, (389), 256 states have internal predecessors, (389), 49 states have call successors, (49), 18 states have call predecessors, (49), 20 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2025-02-05 15:42:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 493 transitions. [2025-02-05 15:42:40,312 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 493 transitions. Word has length 123 [2025-02-05 15:42:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:40,312 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 493 transitions. [2025-02-05 15:42:40,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:42:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 493 transitions. [2025-02-05 15:42:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:42:40,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:40,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:40,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:42:40,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:40,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 87187323, now seen corresponding path program 2 times [2025-02-05 15:42:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106841219] [2025-02-05 15:42:40,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:42:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:40,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-02-05 15:42:40,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:42:40,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:42:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:42:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106841219] [2025-02-05 15:42:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106841219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:42:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461582647] [2025-02-05 15:42:40,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:42:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:40,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:42:40,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:40,501 INFO L87 Difference]: Start difference. First operand 323 states and 493 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:42:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:40,579 INFO L93 Difference]: Finished difference Result 619 states and 954 transitions. [2025-02-05 15:42:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:42:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 124 [2025-02-05 15:42:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:40,582 INFO L225 Difference]: With dead ends: 619 [2025-02-05 15:42:40,583 INFO L226 Difference]: Without dead ends: 325 [2025-02-05 15:42:40,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:40,585 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 2 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:40,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1957 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:42:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-05 15:42:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-02-05 15:42:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 254 states have (on average 1.5354330708661417) internal successors, (390), 258 states have internal predecessors, (390), 49 states have call successors, (49), 18 states have call predecessors, (49), 21 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2025-02-05 15:42:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 499 transitions. [2025-02-05 15:42:40,602 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 499 transitions. Word has length 124 [2025-02-05 15:42:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:40,603 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 499 transitions. [2025-02-05 15:42:40,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:42:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 499 transitions. [2025-02-05 15:42:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:42:40,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:40,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:40,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:42:40,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1952169507, now seen corresponding path program 1 times [2025-02-05 15:42:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659505460] [2025-02-05 15:42:40,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:40,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:42:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:42:40,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:40,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659505460] [2025-02-05 15:42:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659505460] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458246879] [2025-02-05 15:42:40,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:40,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:40,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:40,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:42:40,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:42:40,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:42:41,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:42:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:41,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:42:41,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:41,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:42:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:41,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458246879] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:42:41,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:42:41,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:42:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782987410] [2025-02-05 15:42:41,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:42:41,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:42:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:41,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:42:41,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:41,232 INFO L87 Difference]: Start difference. First operand 325 states and 499 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:42:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:41,406 INFO L93 Difference]: Finished difference Result 770 states and 1231 transitions. [2025-02-05 15:42:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:42:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 125 [2025-02-05 15:42:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:41,413 INFO L225 Difference]: With dead ends: 770 [2025-02-05 15:42:41,413 INFO L226 Difference]: Without dead ends: 647 [2025-02-05 15:42:41,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:41,416 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 517 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:41,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1254 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:42:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-02-05 15:42:41,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 623. [2025-02-05 15:42:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 488 states have (on average 1.6045081967213115) internal successors, (783), 492 states have internal predecessors, (783), 113 states have call successors, (113), 18 states have call predecessors, (113), 21 states have return successors, (134), 112 states have call predecessors, (134), 112 states have call successors, (134) [2025-02-05 15:42:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1030 transitions. [2025-02-05 15:42:41,459 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1030 transitions. Word has length 125 [2025-02-05 15:42:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:41,460 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1030 transitions. [2025-02-05 15:42:41,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:42:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1030 transitions. [2025-02-05 15:42:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:42:41,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:41,465 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:41,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:42:41,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:42:41,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1889227075, now seen corresponding path program 1 times [2025-02-05 15:42:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081473894] [2025-02-05 15:42:41,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:41,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:42:41,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:42:41,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:41,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:41,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081473894] [2025-02-05 15:42:41,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081473894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:41,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:41,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:41,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610627487] [2025-02-05 15:42:41,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:41,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:41,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:41,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:41,762 INFO L87 Difference]: Start difference. First operand 623 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:41,803 INFO L93 Difference]: Finished difference Result 1481 states and 2487 transitions. [2025-02-05 15:42:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:41,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-02-05 15:42:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:41,812 INFO L225 Difference]: With dead ends: 1481 [2025-02-05 15:42:41,812 INFO L226 Difference]: Without dead ends: 926 [2025-02-05 15:42:41,815 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-02-05 15:42:41,816 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 97 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:41,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 814 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-02-05 15:42:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 918. [2025-02-05 15:42:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 719 states have (on average 1.6175243393602226) internal successors, (1163), 723 states have internal predecessors, (1163), 177 states have call successors, (177), 18 states have call predecessors, (177), 21 states have return successors, (208), 176 states have call predecessors, (208), 176 states have call successors, (208) [2025-02-05 15:42:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1548 transitions. [2025-02-05 15:42:41,873 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1548 transitions. Word has length 131 [2025-02-05 15:42:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:41,874 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1548 transitions. [2025-02-05 15:42:41,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1548 transitions. [2025-02-05 15:42:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:42:41,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:41,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:41,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:42:41,882 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:41,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash -963485042, now seen corresponding path program 1 times [2025-02-05 15:42:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147127668] [2025-02-05 15:42:41,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:42:41,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:42:41,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:41,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147127668] [2025-02-05 15:42:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147127668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630699133] [2025-02-05 15:42:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:42,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:42,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:42,005 INFO L87 Difference]: Start difference. First operand 918 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:42,069 INFO L93 Difference]: Finished difference Result 2185 states and 3705 transitions. [2025-02-05 15:42:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-05 15:42:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:42,084 INFO L225 Difference]: With dead ends: 2185 [2025-02-05 15:42:42,084 INFO L226 Difference]: Without dead ends: 1386 [2025-02-05 15:42:42,089 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-02-05 15:42:42,090 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 95 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:42,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 804 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-02-05 15:42:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1378. [2025-02-05 15:42:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1084 states have (on average 1.6254612546125462) internal successors, (1762), 1088 states have internal predecessors, (1762), 272 states have call successors, (272), 18 states have call predecessors, (272), 21 states have return successors, (303), 271 states have call predecessors, (303), 271 states have call successors, (303) [2025-02-05 15:42:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2337 transitions. [2025-02-05 15:42:42,190 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2337 transitions. Word has length 132 [2025-02-05 15:42:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:42,193 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2337 transitions. [2025-02-05 15:42:42,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2337 transitions. [2025-02-05 15:42:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:42:42,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:42,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:42,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:42:42,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:42,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -963015902, now seen corresponding path program 1 times [2025-02-05 15:42:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137320999] [2025-02-05 15:42:42,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:42,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:42:42,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:42:42,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:42,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137320999] [2025-02-05 15:42:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137320999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:42,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81744697] [2025-02-05 15:42:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:42,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:42,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:42,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:42,286 INFO L87 Difference]: Start difference. First operand 1378 states and 2337 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:42,367 INFO L93 Difference]: Finished difference Result 3214 states and 5494 transitions. [2025-02-05 15:42:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:42,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-02-05 15:42:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:42,384 INFO L225 Difference]: With dead ends: 3214 [2025-02-05 15:42:42,384 INFO L226 Difference]: Without dead ends: 2077 [2025-02-05 15:42:42,390 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-02-05 15:42:42,391 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 93 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:42,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 797 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-02-05 15:42:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2069. [2025-02-05 15:42:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1652 states have (on average 1.631961259079903) internal successors, (2696), 1656 states have internal predecessors, (2696), 395 states have call successors, (395), 18 states have call predecessors, (395), 21 states have return successors, (442), 394 states have call predecessors, (442), 394 states have call successors, (442) [2025-02-05 15:42:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3533 transitions. [2025-02-05 15:42:42,569 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3533 transitions. Word has length 133 [2025-02-05 15:42:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:42,569 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3533 transitions. [2025-02-05 15:42:42,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3533 transitions. [2025-02-05 15:42:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:42:42,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:42,584 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:42,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:42:42,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:42,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:42,585 INFO L85 PathProgramCache]: Analyzing trace with hash 533183055, now seen corresponding path program 1 times [2025-02-05 15:42:42,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:42,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471610330] [2025-02-05 15:42:42,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:42,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:42:42,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:42:42,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:42,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:42,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471610330] [2025-02-05 15:42:42,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471610330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:42,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:42,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225307160] [2025-02-05 15:42:42,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:42,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:42,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:42,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:42,663 INFO L87 Difference]: Start difference. First operand 2069 states and 3533 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:42,821 INFO L93 Difference]: Finished difference Result 4802 states and 8260 transitions. [2025-02-05 15:42:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:42,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-02-05 15:42:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:42,848 INFO L225 Difference]: With dead ends: 4802 [2025-02-05 15:42:42,849 INFO L226 Difference]: Without dead ends: 3174 [2025-02-05 15:42:42,859 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-02-05 15:42:42,860 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 91 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:42,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 797 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2025-02-05 15:42:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 3166. [2025-02-05 15:42:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3166 states, 2570 states have (on average 1.6361867704280155) internal successors, (4205), 2574 states have internal predecessors, (4205), 574 states have call successors, (574), 18 states have call predecessors, (574), 21 states have return successors, (647), 573 states have call predecessors, (647), 573 states have call successors, (647) [2025-02-05 15:42:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 5426 transitions. [2025-02-05 15:42:43,091 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 5426 transitions. Word has length 134 [2025-02-05 15:42:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:43,092 INFO L471 AbstractCegarLoop]: Abstraction has 3166 states and 5426 transitions. [2025-02-05 15:42:43,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 5426 transitions. [2025-02-05 15:42:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:42:43,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:43,112 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:43,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:42:43,112 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:43,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1071474209, now seen corresponding path program 1 times [2025-02-05 15:42:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:43,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378258221] [2025-02-05 15:42:43,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:43,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:42:43,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:42:43,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:43,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378258221] [2025-02-05 15:42:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378258221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:43,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:43,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761895544] [2025-02-05 15:42:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:43,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:43,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:43,191 INFO L87 Difference]: Start difference. First operand 3166 states and 5426 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:43,412 INFO L93 Difference]: Finished difference Result 7664 states and 13203 transitions. [2025-02-05 15:42:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:43,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-02-05 15:42:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:43,453 INFO L225 Difference]: With dead ends: 7664 [2025-02-05 15:42:43,453 INFO L226 Difference]: Without dead ends: 5166 [2025-02-05 15:42:43,468 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-02-05 15:42:43,468 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 89 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:43,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 817 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-02-05 15:42:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5158. [2025-02-05 15:42:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5158 states, 4186 states have (on average 1.62876254180602) internal successors, (6818), 4190 states have internal predecessors, (6818), 950 states have call successors, (950), 18 states have call predecessors, (950), 21 states have return successors, (1067), 949 states have call predecessors, (1067), 949 states have call successors, (1067) [2025-02-05 15:42:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 8835 transitions. [2025-02-05 15:42:43,851 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 8835 transitions. Word has length 135 [2025-02-05 15:42:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:43,851 INFO L471 AbstractCegarLoop]: Abstraction has 5158 states and 8835 transitions. [2025-02-05 15:42:43,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 8835 transitions. [2025-02-05 15:42:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:42:43,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:43,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:43,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:42:43,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:43,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash 267157840, now seen corresponding path program 1 times [2025-02-05 15:42:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759002703] [2025-02-05 15:42:43,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:43,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:42:43,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:42:43,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:43,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:43,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759002703] [2025-02-05 15:42:43,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759002703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:43,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:43,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80416075] [2025-02-05 15:42:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:43,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:43,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:43,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:43,955 INFO L87 Difference]: Start difference. First operand 5158 states and 8835 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:44,238 INFO L93 Difference]: Finished difference Result 12701 states and 21896 transitions. [2025-02-05 15:42:44,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:44,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-02-05 15:42:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:44,384 INFO L225 Difference]: With dead ends: 12701 [2025-02-05 15:42:44,388 INFO L226 Difference]: Without dead ends: 8582 [2025-02-05 15:42:44,406 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-02-05 15:42:44,407 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 87 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:44,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 800 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8582 states. [2025-02-05 15:42:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8582 to 8574. [2025-02-05 15:42:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8574 states, 6996 states have (on average 1.6266437964551173) internal successors, (11380), 7000 states have internal predecessors, (11380), 1556 states have call successors, (1556), 18 states have call predecessors, (1556), 21 states have return successors, (1751), 1555 states have call predecessors, (1751), 1555 states have call successors, (1751) [2025-02-05 15:42:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8574 states to 8574 states and 14687 transitions. [2025-02-05 15:42:44,960 INFO L78 Accepts]: Start accepts. Automaton has 8574 states and 14687 transitions. Word has length 136 [2025-02-05 15:42:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:44,961 INFO L471 AbstractCegarLoop]: Abstraction has 8574 states and 14687 transitions. [2025-02-05 15:42:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8574 states and 14687 transitions. [2025-02-05 15:42:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:42:45,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:45,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:45,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:42:45,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:45,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 974106816, now seen corresponding path program 1 times [2025-02-05 15:42:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:45,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137223289] [2025-02-05 15:42:45,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:45,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:42:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:42:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137223289] [2025-02-05 15:42:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137223289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117024902] [2025-02-05 15:42:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:45,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:45,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:45,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:45,091 INFO L87 Difference]: Start difference. First operand 8574 states and 14687 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:45,653 INFO L93 Difference]: Finished difference Result 22158 states and 38119 transitions. [2025-02-05 15:42:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:45,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-02-05 15:42:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:45,749 INFO L225 Difference]: With dead ends: 22158 [2025-02-05 15:42:45,749 INFO L226 Difference]: Without dead ends: 15038 [2025-02-05 15:42:45,797 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-02-05 15:42:45,798 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 85 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:45,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 808 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15038 states. [2025-02-05 15:42:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15038 to 15030. [2025-02-05 15:42:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15030 states, 12249 states have (on average 1.6171932402645113) internal successors, (19809), 12253 states have internal predecessors, (19809), 2759 states have call successors, (2759), 18 states have call predecessors, (2759), 21 states have return successors, (3098), 2758 states have call predecessors, (3098), 2758 states have call successors, (3098) [2025-02-05 15:42:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15030 states to 15030 states and 25666 transitions. [2025-02-05 15:42:46,686 INFO L78 Accepts]: Start accepts. Automaton has 15030 states and 25666 transitions. Word has length 137 [2025-02-05 15:42:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:46,687 INFO L471 AbstractCegarLoop]: Abstraction has 15030 states and 25666 transitions. [2025-02-05 15:42:46,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 15030 states and 25666 transitions. [2025-02-05 15:42:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:42:46,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:46,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:46,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:42:46,744 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:46,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2098102545, now seen corresponding path program 1 times [2025-02-05 15:42:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:46,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011016174] [2025-02-05 15:42:46,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:46,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:42:46,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:42:46,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:46,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:46,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011016174] [2025-02-05 15:42:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011016174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101071404] [2025-02-05 15:42:46,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:46,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:46,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:46,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:46,826 INFO L87 Difference]: Start difference. First operand 15030 states and 25666 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:47,624 INFO L93 Difference]: Finished difference Result 39719 states and 68167 transitions. [2025-02-05 15:42:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:47,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-02-05 15:42:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:47,773 INFO L225 Difference]: With dead ends: 39719 [2025-02-05 15:42:47,774 INFO L226 Difference]: Without dead ends: 26742 [2025-02-05 15:42:47,837 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-02-05 15:42:47,838 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 83 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:47,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 800 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26742 states. [2025-02-05 15:42:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26742 to 26734. [2025-02-05 15:42:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26734 states, 21914 states have (on average 1.613169663228986) internal successors, (35351), 21918 states have internal predecessors, (35351), 4798 states have call successors, (4798), 18 states have call predecessors, (4798), 21 states have return successors, (5411), 4797 states have call predecessors, (5411), 4797 states have call successors, (5411) [2025-02-05 15:42:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26734 states to 26734 states and 45560 transitions. [2025-02-05 15:42:49,442 INFO L78 Accepts]: Start accepts. Automaton has 26734 states and 45560 transitions. Word has length 138 [2025-02-05 15:42:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:49,443 INFO L471 AbstractCegarLoop]: Abstraction has 26734 states and 45560 transitions. [2025-02-05 15:42:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 26734 states and 45560 transitions. [2025-02-05 15:42:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:42:49,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:49,528 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:42:49,528 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:49,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash -637552001, now seen corresponding path program 1 times [2025-02-05 15:42:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010170337] [2025-02-05 15:42:49,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:49,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:42:49,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:42:49,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:49,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:49,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010170337] [2025-02-05 15:42:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010170337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383375192] [2025-02-05 15:42:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:49,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:49,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:49,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:49,626 INFO L87 Difference]: Start difference. First operand 26734 states and 45560 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:50,973 INFO L93 Difference]: Finished difference Result 72726 states and 124454 transitions. [2025-02-05 15:42:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-02-05 15:42:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:51,300 INFO L225 Difference]: With dead ends: 72726 [2025-02-05 15:42:51,301 INFO L226 Difference]: Without dead ends: 48768 [2025-02-05 15:42:51,420 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-02-05 15:42:51,421 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 81 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:51,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 801 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48768 states. [2025-02-05 15:42:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48768 to 48760. [2025-02-05 15:42:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48760 states, 40225 states have (on average 1.6076817899316345) internal successors, (64669), 40229 states have internal predecessors, (64669), 8513 states have call successors, (8513), 18 states have call predecessors, (8513), 21 states have return successors, (9658), 8512 states have call predecessors, (9658), 8512 states have call successors, (9658) [2025-02-05 15:42:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48760 states to 48760 states and 82840 transitions. [2025-02-05 15:42:54,333 INFO L78 Accepts]: Start accepts. Automaton has 48760 states and 82840 transitions. Word has length 139 [2025-02-05 15:42:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 48760 states and 82840 transitions. [2025-02-05 15:42:54,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 48760 states and 82840 transitions. [2025-02-05 15:42:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:42:54,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:54,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:42:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:42:54,421 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:54,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1564113550, now seen corresponding path program 1 times [2025-02-05 15:42:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668588934] [2025-02-05 15:42:54,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:42:54,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:42:54,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:54,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668588934] [2025-02-05 15:42:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668588934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820732725] [2025-02-05 15:42:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:54,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:54,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:54,514 INFO L87 Difference]: Start difference. First operand 48760 states and 82840 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:56,649 INFO L93 Difference]: Finished difference Result 90702 states and 154506 transitions. [2025-02-05 15:42:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:56,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-02-05 15:42:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:57,190 INFO L225 Difference]: With dead ends: 90702 [2025-02-05 15:42:57,190 INFO L226 Difference]: Without dead ends: 90579 [2025-02-05 15:42:57,256 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-02-05 15:42:57,257 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 76 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:57,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 814 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90579 states. [2025-02-05 15:43:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90579 to 90571. [2025-02-05 15:43:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90571 states, 75237 states have (on average 1.6005688690404987) internal successors, (120422), 75241 states have internal predecessors, (120422), 15312 states have call successors, (15312), 18 states have call predecessors, (15312), 21 states have return successors, (17503), 15311 states have call predecessors, (17503), 15311 states have call successors, (17503) [2025-02-05 15:43:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90571 states to 90571 states and 153237 transitions. [2025-02-05 15:43:01,036 INFO L78 Accepts]: Start accepts. Automaton has 90571 states and 153237 transitions. Word has length 140 [2025-02-05 15:43:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:01,037 INFO L471 AbstractCegarLoop]: Abstraction has 90571 states and 153237 transitions. [2025-02-05 15:43:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 90571 states and 153237 transitions. [2025-02-05 15:43:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:43:01,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:01,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:43:01,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:43:01,111 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:01,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1452254210, now seen corresponding path program 1 times [2025-02-05 15:43:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850933023] [2025-02-05 15:43:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:01,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:43:01,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:43:01,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:01,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:01,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850933023] [2025-02-05 15:43:01,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850933023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:01,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:01,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:43:01,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115625890] [2025-02-05 15:43:01,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:01,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:43:01,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:01,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:43:01,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:01,283 INFO L87 Difference]: Start difference. First operand 90571 states and 153237 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:03,939 INFO L93 Difference]: Finished difference Result 90803 states and 153554 transitions. [2025-02-05 15:43:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:43:03,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 141 [2025-02-05 15:43:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:04,469 INFO L225 Difference]: With dead ends: 90803 [2025-02-05 15:43:04,470 INFO L226 Difference]: Without dead ends: 90690 [2025-02-05 15:43:04,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:43:04,537 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 336 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:04,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1708 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:43:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90690 states. [2025-02-05 15:43:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90690 to 90686. [2025-02-05 15:43:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90686 states, 75330 states have (on average 1.6003716978627374) internal successors, (120556), 75334 states have internal predecessors, (120556), 15323 states have call successors, (15323), 27 states have call predecessors, (15323), 32 states have return successors, (17516), 15324 states have call predecessors, (17516), 15321 states have call successors, (17516) [2025-02-05 15:43:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90686 states to 90686 states and 153395 transitions. [2025-02-05 15:43:08,217 INFO L78 Accepts]: Start accepts. Automaton has 90686 states and 153395 transitions. Word has length 141 [2025-02-05 15:43:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:08,218 INFO L471 AbstractCegarLoop]: Abstraction has 90686 states and 153395 transitions. [2025-02-05 15:43:08,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 90686 states and 153395 transitions. [2025-02-05 15:43:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:43:08,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:08,302 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:43:08,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:43:08,302 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:08,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -946067499, now seen corresponding path program 1 times [2025-02-05 15:43:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360211601] [2025-02-05 15:43:08,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:08,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:43:08,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:43:08,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:08,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:08,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:08,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360211601] [2025-02-05 15:43:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360211601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:08,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 15:43:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709480688] [2025-02-05 15:43:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:08,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:43:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:08,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:43:08,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:43:08,660 INFO L87 Difference]: Start difference. First operand 90686 states and 153395 transitions. Second operand has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-05 15:43:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:11,900 INFO L93 Difference]: Finished difference Result 90991 states and 153816 transitions. [2025-02-05 15:43:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:43:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 142 [2025-02-05 15:43:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:12,386 INFO L225 Difference]: With dead ends: 90991 [2025-02-05 15:43:12,386 INFO L226 Difference]: Without dead ends: 90743 [2025-02-05 15:43:12,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:43:12,435 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 121 mSDsluCounter, 4296 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 4688 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:12,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 4688 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90743 states. [2025-02-05 15:43:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90743 to 90739. [2025-02-05 15:43:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90739 states, 75371 states have (on average 1.6002441257247482) internal successors, (120612), 75377 states have internal predecessors, (120612), 15334 states have call successors, (15334), 28 states have call predecessors, (15334), 33 states have return successors, (17527), 15333 states have call predecessors, (17527), 15332 states have call successors, (17527) [2025-02-05 15:43:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90739 states to 90739 states and 153473 transitions. [2025-02-05 15:43:16,358 INFO L78 Accepts]: Start accepts. Automaton has 90739 states and 153473 transitions. Word has length 142 [2025-02-05 15:43:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:16,359 INFO L471 AbstractCegarLoop]: Abstraction has 90739 states and 153473 transitions. [2025-02-05 15:43:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-05 15:43:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 90739 states and 153473 transitions. [2025-02-05 15:43:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 15:43:16,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:16,528 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:43:16,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:43:16,528 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:16,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash 12024984, now seen corresponding path program 1 times [2025-02-05 15:43:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:16,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728202598] [2025-02-05 15:43:16,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:16,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 15:43:16,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 15:43:16,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:16,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 15:43:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728202598] [2025-02-05 15:43:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728202598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:43:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298839640] [2025-02-05 15:43:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:16,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:43:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:16,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:43:16,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:16,736 INFO L87 Difference]: Start difference. First operand 90739 states and 153473 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17)