./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_product31.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 beb678f648eb46083c76f273f6eef79e0abada1343858eba26829a720997a379 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:53:21,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:53:21,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:53:21,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:53:21,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:53:21,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:53:21,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:53:21,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:53:21,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:53:21,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:53:21,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:53:21,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:53:21,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:53:21,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:53:21,554 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:53:21,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:53:21,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:53:21,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:21,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:53:21,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:21,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:53:21,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:53:21,558 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 -> beb678f648eb46083c76f273f6eef79e0abada1343858eba26829a720997a379 [2025-01-09 03:53:21,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:53:21,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:53:21,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:53:21,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:53:21,789 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:53:21,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product31.cil.c [2025-01-09 03:53:23,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd32606cc/5620fe65422c4b1eba8fc680f6fa8895/FLAGe5c202314 [2025-01-09 03:53:23,657 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:53:23,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product31.cil.c [2025-01-09 03:53:23,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd32606cc/5620fe65422c4b1eba8fc680f6fa8895/FLAGe5c202314 [2025-01-09 03:53:23,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd32606cc/5620fe65422c4b1eba8fc680f6fa8895 [2025-01-09 03:53:23,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:53:23,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:53:23,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:53:23,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:53:23,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:53:23,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:53:23" (1/1) ... [2025-01-09 03:53:23,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6a1c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:23, skipping insertion in model container [2025-01-09 03:53:23,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:53:23" (1/1) ... [2025-01-09 03:53:23,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:53:24,078 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_spec3_product31.cil.c[42138,42151] [2025-01-09 03:53:24,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:53:24,163 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:53:24,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-01-09 03:53:24,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1128] [2025-01-09 03:53:24,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1435] [2025-01-09 03:53:24,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1801] [2025-01-09 03:53:24,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1836] [2025-01-09 03:53:24,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1845] [2025-01-09 03:53:24,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2061] [2025-01-09 03:53:24,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2436] [2025-01-09 03:53:24,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2494] [2025-01-09 03:53:24,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2893] [2025-01-09 03:53:24,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3028] [2025-01-09 03:53:24,234 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_spec3_product31.cil.c[42138,42151] [2025-01-09 03:53:24,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:53:24,288 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:53:24,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24 WrapperNode [2025-01-09 03:53:24,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:53:24,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:53:24,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:53:24,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:53:24,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,380 INFO L138 Inliner]: procedures = 132, calls = 211, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1058 [2025-01-09 03:53:24,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:53:24,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:53:24,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:53:24,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:53:24,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,414 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-01-09 03:53:24,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:53:24,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:53:24,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:53:24,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:53:24,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (1/1) ... [2025-01-09 03:53:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:24,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:53:24,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:53:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:53:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:53:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:53:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:53:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:53:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:53:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:53:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:53:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:53:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:53:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:53:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:53:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:53:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:53:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:53:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:53:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:53:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:53:24,522 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:53:24,522 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:53:24,522 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:53:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:53:24,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:53:24,699 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:53:24,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:53:25,461 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2025-01-09 03:53:25,461 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:53:25,472 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:53:25,472 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:53:25,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:53:25 BoogieIcfgContainer [2025-01-09 03:53:25,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:53:25,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:53:25,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:53:25,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:53:25,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:53:23" (1/3) ... [2025-01-09 03:53:25,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae6bc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:53:25, skipping insertion in model container [2025-01-09 03:53:25,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:24" (2/3) ... [2025-01-09 03:53:25,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae6bc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:53:25, skipping insertion in model container [2025-01-09 03:53:25,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:53:25" (3/3) ... [2025-01-09 03:53:25,479 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product31.cil.c [2025-01-09 03:53:25,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:53:25,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product31.cil.c that has 25 procedures, 379 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:53:25,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:53:25,549 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;@38520a33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:53:25,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:53:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 379 states, 289 states have (on average 1.494809688581315) internal successors, (432), 295 states have internal predecessors, (432), 64 states have call successors, (64), 24 states have call predecessors, (64), 24 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 03:53:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:53:25,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:25,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 03:53:25,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -44600307, now seen corresponding path program 1 times [2025-01-09 03:53:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152466222] [2025-01-09 03:53:25,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:53:25,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:53:25,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:25,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:53:26,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152466222] [2025-01-09 03:53:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152466222] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306070278] [2025-01-09 03:53:26,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:26,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:26,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:26,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:53:26,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:53:26,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:53:26,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:26,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:26,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:53:26,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:53:26,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306070278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:53:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700275832] [2025-01-09 03:53:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:26,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:53:26,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:26,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:53:26,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:26,629 INFO L87 Difference]: Start difference. First operand has 379 states, 289 states have (on average 1.494809688581315) internal successors, (432), 295 states have internal predecessors, (432), 64 states have call successors, (64), 24 states have call predecessors, (64), 24 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:26,679 INFO L93 Difference]: Finished difference Result 604 states and 876 transitions. [2025-01-09 03:53:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:53:26,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2025-01-09 03:53:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:26,696 INFO L225 Difference]: With dead ends: 604 [2025-01-09 03:53:26,696 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 03:53:26,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-01-09 03:53:26,704 INFO L435 NwaCegarLoop]: 555 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, 555 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:26,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 03:53:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-01-09 03:53:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 283 states have (on average 1.4911660777385158) internal successors, (422), 287 states have internal predecessors, (422), 64 states have call successors, (64), 24 states have call predecessors, (64), 23 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:53:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 547 transitions. [2025-01-09 03:53:26,755 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 547 transitions. Word has length 130 [2025-01-09 03:53:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:26,756 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 547 transitions. [2025-01-09 03:53:26,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 547 transitions. [2025-01-09 03:53:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:53:26,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:26,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 03:53:26,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:53:26,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:53:26,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:26,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1015968371, now seen corresponding path program 1 times [2025-01-09 03:53:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:26,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360216297] [2025-01-09 03:53:26,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:53:27,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:53:27,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:27,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:53:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360216297] [2025-01-09 03:53:27,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360216297] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653712131] [2025-01-09 03:53:27,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:27,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:27,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:27,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:27,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:53:27,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:53:27,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:53:27,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:27,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:27,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:53:27,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:53:27,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:27,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653712131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:27,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:53:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692417360] [2025-01-09 03:53:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:27,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:27,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:27,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:27,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:27,595 INFO L87 Difference]: Start difference. First operand 371 states and 547 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:27,642 INFO L93 Difference]: Finished difference Result 592 states and 853 transitions. [2025-01-09 03:53:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:27,642 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2025-01-09 03:53:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:27,648 INFO L225 Difference]: With dead ends: 592 [2025-01-09 03:53:27,648 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 03:53:27,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 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-01-09 03:53:27,649 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:27,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 03:53:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2025-01-09 03:53:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 284 states have (on average 1.4894366197183098) internal successors, (423), 288 states have internal predecessors, (423), 64 states have call successors, (64), 24 states have call predecessors, (64), 23 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:53:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 548 transitions. [2025-01-09 03:53:27,680 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 548 transitions. Word has length 130 [2025-01-09 03:53:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:27,681 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 548 transitions. [2025-01-09 03:53:27,681 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 548 transitions. [2025-01-09 03:53:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:53:27,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:27,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 03:53:27,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:27,885 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-01-09 03:53:27,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:27,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1206770785, now seen corresponding path program 1 times [2025-01-09 03:53:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:27,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604514952] [2025-01-09 03:53:27,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:27,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:53:27,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:53:27,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:27,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:53:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604514952] [2025-01-09 03:53:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604514952] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473080610] [2025-01-09 03:53:28,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:28,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:28,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:28,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:53:28,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:53:28,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:53:28,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:28,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:28,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:53:28,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473080610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:28,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:53:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160686011] [2025-01-09 03:53:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:28,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:28,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:28,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:28,445 INFO L87 Difference]: Start difference. First operand 372 states and 548 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:28,484 INFO L93 Difference]: Finished difference Result 774 states and 1155 transitions. [2025-01-09 03:53:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-01-09 03:53:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:28,488 INFO L225 Difference]: With dead ends: 774 [2025-01-09 03:53:28,488 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 03:53:28,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 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-01-09 03:53:28,490 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 107 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1055 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-01-09 03:53:28,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 03:53:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2025-01-09 03:53:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 325 states have internal predecessors, (484), 75 states have call successors, (75), 24 states have call predecessors, (75), 23 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 03:53:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 631 transitions. [2025-01-09 03:53:28,523 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 631 transitions. Word has length 135 [2025-01-09 03:53:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:28,523 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 631 transitions. [2025-01-09 03:53:28,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 631 transitions. [2025-01-09 03:53:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:53:28,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:28,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 03:53:28,537 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-01-09 03:53:28,728 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-01-09 03:53:28,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1000903902, now seen corresponding path program 1 times [2025-01-09 03:53:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:28,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569435770] [2025-01-09 03:53:28,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:28,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:53:28,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:53:28,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:53:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569435770] [2025-01-09 03:53:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569435770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777630687] [2025-01-09 03:53:28,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:28,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:28,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:28,899 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-01-09 03:53:28,900 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-01-09 03:53:29,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:53:29,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:53:29,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:29,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:29,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:53:29,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:29,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777630687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:53:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133011665] [2025-01-09 03:53:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:29,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:29,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:29,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:29,229 INFO L87 Difference]: Start difference. First operand 420 states and 631 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:29,325 INFO L93 Difference]: Finished difference Result 831 states and 1252 transitions. [2025-01-09 03:53:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:29,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2025-01-09 03:53:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:29,328 INFO L225 Difference]: With dead ends: 831 [2025-01-09 03:53:29,329 INFO L226 Difference]: Without dead ends: 422 [2025-01-09 03:53:29,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 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-01-09 03:53:29,331 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2145 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:29,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-09 03:53:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2025-01-09 03:53:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 322 states have (on average 1.5062111801242235) internal successors, (485), 327 states have internal predecessors, (485), 75 states have call successors, (75), 24 states have call predecessors, (75), 24 states have return successors, (74), 72 states have call predecessors, (74), 72 states have call successors, (74) [2025-01-09 03:53:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 634 transitions. [2025-01-09 03:53:29,350 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 634 transitions. Word has length 136 [2025-01-09 03:53:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:29,351 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 634 transitions. [2025-01-09 03:53:29,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 634 transitions. [2025-01-09 03:53:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 03:53:29,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:29,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:53:29,365 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-01-09 03:53:29,555 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-01-09 03:53:29,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:29,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash -959078898, now seen corresponding path program 1 times [2025-01-09 03:53:29,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941547154] [2025-01-09 03:53:29,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:29,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:53:29,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:53:29,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:29,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:29,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:29,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941547154] [2025-01-09 03:53:29,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941547154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:29,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818713093] [2025-01-09 03:53:29,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:29,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:29,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:29,715 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-01-09 03:53:29,716 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-01-09 03:53:29,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:53:29,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:53:29,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:29,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:29,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:53:29,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:30,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:30,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818713093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:30,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:30,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:53:30,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091718411] [2025-01-09 03:53:30,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:30,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:30,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:30,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:53:30,082 INFO L87 Difference]: Start difference. First operand 422 states and 634 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:30,144 INFO L93 Difference]: Finished difference Result 833 states and 1257 transitions. [2025-01-09 03:53:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 137 [2025-01-09 03:53:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:30,148 INFO L225 Difference]: With dead ends: 833 [2025-01-09 03:53:30,148 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 03:53:30,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 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-01-09 03:53:30,152 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2131 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-01-09 03:53:30,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2131 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 03:53:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-01-09 03:53:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 329 states have internal predecessors, (486), 75 states have call successors, (75), 24 states have call predecessors, (75), 25 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2025-01-09 03:53:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 640 transitions. [2025-01-09 03:53:30,177 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 640 transitions. Word has length 137 [2025-01-09 03:53:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:30,177 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 640 transitions. [2025-01-09 03:53:30,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 640 transitions. [2025-01-09 03:53:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:53:30,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:30,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:30,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:30,379 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-01-09 03:53:30,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:30,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1101962768, now seen corresponding path program 1 times [2025-01-09 03:53:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103354964] [2025-01-09 03:53:30,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:30,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:53:30,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:53:30,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:30,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:53:30,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103354964] [2025-01-09 03:53:30,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103354964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:30,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:30,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:30,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474005332] [2025-01-09 03:53:30,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:30,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:30,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:30,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:30,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:30,522 INFO L87 Difference]: Start difference. First operand 424 states and 640 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:30,559 INFO L93 Difference]: Finished difference Result 825 states and 1248 transitions. [2025-01-09 03:53:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:30,560 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 138 [2025-01-09 03:53:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:30,563 INFO L225 Difference]: With dead ends: 825 [2025-01-09 03:53:30,563 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 03:53:30,564 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-01-09 03:53:30,566 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2149 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-01-09 03:53:30,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2149 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 03:53:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-01-09 03:53:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 329 states have internal predecessors, (486), 75 states have call successors, (75), 24 states have call predecessors, (75), 25 states have return successors, (78), 72 states have call predecessors, (78), 72 states have call successors, (78) [2025-01-09 03:53:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 639 transitions. [2025-01-09 03:53:30,592 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 639 transitions. Word has length 138 [2025-01-09 03:53:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:30,592 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 639 transitions. [2025-01-09 03:53:30,593 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 639 transitions. [2025-01-09 03:53:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:53:30,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:30,595 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-01-09 03:53:30,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:53:30,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:30,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash -423054914, now seen corresponding path program 2 times [2025-01-09 03:53:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:30,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787566909] [2025-01-09 03:53:30,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:53:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:30,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-01-09 03:53:30,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 139 statements. [2025-01-09 03:53:30,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:53:30,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:53:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787566909] [2025-01-09 03:53:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787566909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:30,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:30,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:53:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853256962] [2025-01-09 03:53:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:30,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:30,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:30,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:30,750 INFO L87 Difference]: Start difference. First operand 424 states and 639 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:31,131 INFO L93 Difference]: Finished difference Result 1196 states and 1784 transitions. [2025-01-09 03:53:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:53:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2025-01-09 03:53:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:31,136 INFO L225 Difference]: With dead ends: 1196 [2025-01-09 03:53:31,136 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 03:53:31,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:53:31,138 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 706 mSDsluCounter, 3152 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:31,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3707 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:53:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 03:53:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 827. [2025-01-09 03:53:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 635 states have (on average 1.5133858267716536) internal successors, (961), 643 states have internal predecessors, (961), 142 states have call successors, (142), 47 states have call predecessors, (142), 49 states have return successors, (153), 140 states have call predecessors, (153), 138 states have call successors, (153) [2025-01-09 03:53:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1256 transitions. [2025-01-09 03:53:31,173 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1256 transitions. Word has length 139 [2025-01-09 03:53:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:31,173 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1256 transitions. [2025-01-09 03:53:31,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1256 transitions. [2025-01-09 03:53:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:53:31,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:31,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:31,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:53:31,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:31,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1752647458, now seen corresponding path program 1 times [2025-01-09 03:53:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580700913] [2025-01-09 03:53:31,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:31,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:53:31,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:53:31,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:31,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:53:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580700913] [2025-01-09 03:53:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580700913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112972706] [2025-01-09 03:53:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:31,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:31,310 INFO L87 Difference]: Start difference. First operand 827 states and 1256 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:31,355 INFO L93 Difference]: Finished difference Result 1633 states and 2485 transitions. [2025-01-09 03:53:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:31,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 140 [2025-01-09 03:53:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:31,359 INFO L225 Difference]: With dead ends: 1633 [2025-01-09 03:53:31,359 INFO L226 Difference]: Without dead ends: 829 [2025-01-09 03:53:31,361 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-01-09 03:53:31,362 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2152 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-01-09 03:53:31,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2152 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-01-09 03:53:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2025-01-09 03:53:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 636 states have (on average 1.5125786163522013) internal successors, (962), 645 states have internal predecessors, (962), 142 states have call successors, (142), 47 states have call predecessors, (142), 50 states have return successors, (155), 140 states have call predecessors, (155), 138 states have call successors, (155) [2025-01-09 03:53:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1259 transitions. [2025-01-09 03:53:31,390 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1259 transitions. Word has length 140 [2025-01-09 03:53:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:31,390 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1259 transitions. [2025-01-09 03:53:31,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:53:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1259 transitions. [2025-01-09 03:53:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 03:53:31,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:31,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:53:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:53:31,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:31,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1861125071, now seen corresponding path program 1 times [2025-01-09 03:53:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670798346] [2025-01-09 03:53:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:31,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 03:53:31,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 03:53:31,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:31,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:31,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670798346] [2025-01-09 03:53:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670798346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:53:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469470792] [2025-01-09 03:53:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:31,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:31,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:31,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:31,512 INFO L87 Difference]: Start difference. First operand 829 states and 1259 transitions. Second operand has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:53:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:31,612 INFO L93 Difference]: Finished difference Result 1229 states and 1864 transitions. [2025-01-09 03:53:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:53:31,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 141 [2025-01-09 03:53:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:31,616 INFO L225 Difference]: With dead ends: 1229 [2025-01-09 03:53:31,616 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 03:53:31,618 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-01-09 03:53:31,618 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 7 mSDsluCounter, 3157 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3688 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-01-09 03:53:31,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3688 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 03:53:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-01-09 03:53:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 326 states have (on average 1.5) internal successors, (489), 332 states have internal predecessors, (489), 75 states have call successors, (75), 25 states have call predecessors, (75), 26 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2025-01-09 03:53:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 643 transitions. [2025-01-09 03:53:31,633 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 643 transitions. Word has length 141 [2025-01-09 03:53:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:31,633 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 643 transitions. [2025-01-09 03:53:31,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:53:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 643 transitions. [2025-01-09 03:53:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 03:53:31,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:31,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-01-09 03:53:31,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:53:31,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:31,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash 924134165, now seen corresponding path program 1 times [2025-01-09 03:53:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500784384] [2025-01-09 03:53:31,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:31,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 03:53:31,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 03:53:31,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:31,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:31,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:31,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500784384] [2025-01-09 03:53:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500784384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:31,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:53:31,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212257362] [2025-01-09 03:53:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:31,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:31,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:31,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:31,795 INFO L87 Difference]: Start difference. First operand 428 states and 643 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:53:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:31,923 INFO L93 Difference]: Finished difference Result 832 states and 1257 transitions. [2025-01-09 03:53:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:53:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 141 [2025-01-09 03:53:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:31,927 INFO L225 Difference]: With dead ends: 832 [2025-01-09 03:53:31,927 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 03:53:31,929 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-01-09 03:53:31,929 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 5 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3702 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:31,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3702 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 03:53:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-01-09 03:53:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 328 states have (on average 1.4969512195121952) internal successors, (491), 335 states have internal predecessors, (491), 75 states have call successors, (75), 25 states have call predecessors, (75), 27 states have return successors, (84), 72 states have call predecessors, (84), 72 states have call successors, (84) [2025-01-09 03:53:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 650 transitions. [2025-01-09 03:53:31,946 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 650 transitions. Word has length 141 [2025-01-09 03:53:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 650 transitions. [2025-01-09 03:53:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:53:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 650 transitions. [2025-01-09 03:53:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:53:31,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:31,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:31,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:53:31,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:31,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash -625240602, now seen corresponding path program 1 times [2025-01-09 03:53:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:31,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82497085] [2025-01-09 03:53:31,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:31,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:53:31,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:53:31,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:31,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82497085] [2025-01-09 03:53:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82497085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863593809] [2025-01-09 03:53:32,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:32,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:32,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:32,044 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-01-09 03:53:32,051 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-01-09 03:53:32,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:53:32,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:53:32,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:32,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:32,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:32,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:32,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:53:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863593809] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:53:32,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:53:32,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:53:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385689404] [2025-01-09 03:53:32,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:53:32,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:53:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:32,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:53:32,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:53:32,447 INFO L87 Difference]: Start difference. First operand 431 states and 650 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:53:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:32,576 INFO L93 Difference]: Finished difference Result 996 states and 1556 transitions. [2025-01-09 03:53:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:53:32,576 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 142 [2025-01-09 03:53:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:32,580 INFO L225 Difference]: With dead ends: 996 [2025-01-09 03:53:32,580 INFO L226 Difference]: Without dead ends: 777 [2025-01-09 03:53:32,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 281 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-01-09 03:53:32,582 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 416 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:32,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 2453 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-01-09 03:53:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 753. [2025-01-09 03:53:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 586 states have (on average 1.575085324232082) internal successors, (923), 593 states have internal predecessors, (923), 139 states have call successors, (139), 25 states have call predecessors, (139), 27 states have return successors, (158), 136 states have call predecessors, (158), 136 states have call successors, (158) [2025-01-09 03:53:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1220 transitions. [2025-01-09 03:53:32,613 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1220 transitions. Word has length 142 [2025-01-09 03:53:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:32,613 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1220 transitions. [2025-01-09 03:53:32,613 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:53:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1220 transitions. [2025-01-09 03:53:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 03:53:32,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:32,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:32,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:53:32,821 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-01-09 03:53:32,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2003944806, now seen corresponding path program 1 times [2025-01-09 03:53:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974447367] [2025-01-09 03:53:32,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:32,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:53:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:53:32,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:32,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974447367] [2025-01-09 03:53:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974447367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:32,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:32,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68173649] [2025-01-09 03:53:32,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:32,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:32,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:32,954 INFO L87 Difference]: Start difference. First operand 753 states and 1220 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:32,982 INFO L93 Difference]: Finished difference Result 1763 states and 2904 transitions. [2025-01-09 03:53:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:32,983 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2025-01-09 03:53:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:32,988 INFO L225 Difference]: With dead ends: 1763 [2025-01-09 03:53:32,988 INFO L226 Difference]: Without dead ends: 1079 [2025-01-09 03:53:32,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:32,991 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 105 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1098 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-01-09 03:53:32,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1098 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-01-09 03:53:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1071. [2025-01-09 03:53:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 840 states have (on average 1.5964285714285715) internal successors, (1341), 847 states have internal predecessors, (1341), 203 states have call successors, (203), 25 states have call predecessors, (203), 27 states have return successors, (232), 200 states have call predecessors, (232), 200 states have call successors, (232) [2025-01-09 03:53:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1776 transitions. [2025-01-09 03:53:33,026 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1776 transitions. Word has length 149 [2025-01-09 03:53:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:33,026 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1776 transitions. [2025-01-09 03:53:33,027 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1776 transitions. [2025-01-09 03:53:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:53:33,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:33,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:33,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:53:33,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:33,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -901411442, now seen corresponding path program 1 times [2025-01-09 03:53:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879914826] [2025-01-09 03:53:33,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:33,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:53:33,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:53:33,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:33,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:33,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:33,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879914826] [2025-01-09 03:53:33,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879914826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:33,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:33,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:33,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105273552] [2025-01-09 03:53:33,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:33,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:33,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:33,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:33,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:33,083 INFO L87 Difference]: Start difference. First operand 1071 states and 1776 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:33,133 INFO L93 Difference]: Finished difference Result 2526 states and 4220 transitions. [2025-01-09 03:53:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:33,134 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-01-09 03:53:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:33,145 INFO L225 Difference]: With dead ends: 2526 [2025-01-09 03:53:33,146 INFO L226 Difference]: Without dead ends: 1575 [2025-01-09 03:53:33,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:33,151 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 103 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1086 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-01-09 03:53:33,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-01-09 03:53:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1567. [2025-01-09 03:53:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1241 states have (on average 1.6116035455278002) internal successors, (2000), 1248 states have internal predecessors, (2000), 298 states have call successors, (298), 25 states have call predecessors, (298), 27 states have return successors, (327), 295 states have call predecessors, (327), 295 states have call successors, (327) [2025-01-09 03:53:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2625 transitions. [2025-01-09 03:53:33,219 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2625 transitions. Word has length 150 [2025-01-09 03:53:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:33,219 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2625 transitions. [2025-01-09 03:53:33,220 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2625 transitions. [2025-01-09 03:53:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:53:33,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:33,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:53:33,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash -94494524, now seen corresponding path program 1 times [2025-01-09 03:53:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556775791] [2025-01-09 03:53:33,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:33,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:53:33,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:53:33,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:33,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:33,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556775791] [2025-01-09 03:53:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556775791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:33,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778121653] [2025-01-09 03:53:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:33,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:33,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:33,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:33,305 INFO L87 Difference]: Start difference. First operand 1567 states and 2625 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:33,360 INFO L93 Difference]: Finished difference Result 3650 states and 6167 transitions. [2025-01-09 03:53:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:33,361 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2025-01-09 03:53:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:33,376 INFO L225 Difference]: With dead ends: 3650 [2025-01-09 03:53:33,377 INFO L226 Difference]: Without dead ends: 2324 [2025-01-09 03:53:33,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:33,384 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 101 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1083 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-01-09 03:53:33,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2025-01-09 03:53:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2316. [2025-01-09 03:53:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 1867 states have (on average 1.623460096411355) internal successors, (3031), 1874 states have internal predecessors, (3031), 421 states have call successors, (421), 25 states have call predecessors, (421), 27 states have return successors, (466), 418 states have call predecessors, (466), 418 states have call successors, (466) [2025-01-09 03:53:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3918 transitions. [2025-01-09 03:53:33,535 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3918 transitions. Word has length 151 [2025-01-09 03:53:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:33,535 INFO L471 AbstractCegarLoop]: Abstraction has 2316 states and 3918 transitions. [2025-01-09 03:53:33,535 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3918 transitions. [2025-01-09 03:53:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:53:33,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:33,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:33,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:53:33,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:33,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:33,547 INFO L85 PathProgramCache]: Analyzing trace with hash 496415181, now seen corresponding path program 1 times [2025-01-09 03:53:33,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:33,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486134000] [2025-01-09 03:53:33,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:33,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:53:33,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:53:33,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:33,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486134000] [2025-01-09 03:53:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486134000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42687509] [2025-01-09 03:53:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:33,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:33,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:33,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:33,605 INFO L87 Difference]: Start difference. First operand 2316 states and 3918 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:33,682 INFO L93 Difference]: Finished difference Result 5398 states and 9198 transitions. [2025-01-09 03:53:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:33,683 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-01-09 03:53:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:33,699 INFO L225 Difference]: With dead ends: 5398 [2025-01-09 03:53:33,699 INFO L226 Difference]: Without dead ends: 3520 [2025-01-09 03:53:33,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:33,707 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 99 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1083 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-01-09 03:53:33,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3520 states. [2025-01-09 03:53:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3520 to 3512. [2025-01-09 03:53:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 2884 states have (on average 1.6314147018030514) internal successors, (4705), 2891 states have internal predecessors, (4705), 600 states have call successors, (600), 25 states have call predecessors, (600), 27 states have return successors, (671), 597 states have call predecessors, (671), 597 states have call successors, (671) [2025-01-09 03:53:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5976 transitions. [2025-01-09 03:53:33,840 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5976 transitions. Word has length 152 [2025-01-09 03:53:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:33,840 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 5976 transitions. [2025-01-09 03:53:33,840 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5976 transitions. [2025-01-09 03:53:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 03:53:33,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:33,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:33,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:53:33,857 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:33,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1836639928, now seen corresponding path program 1 times [2025-01-09 03:53:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:33,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738892401] [2025-01-09 03:53:33,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:33,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 03:53:33,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 03:53:33,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:33,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:33,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738892401] [2025-01-09 03:53:33,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738892401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:33,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068426813] [2025-01-09 03:53:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:33,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:33,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:33,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:33,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:33,953 INFO L87 Difference]: Start difference. First operand 3512 states and 5976 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:34,068 INFO L93 Difference]: Finished difference Result 8269 states and 14168 transitions. [2025-01-09 03:53:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:34,069 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2025-01-09 03:53:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:34,095 INFO L225 Difference]: With dead ends: 8269 [2025-01-09 03:53:34,096 INFO L226 Difference]: Without dead ends: 5496 [2025-01-09 03:53:34,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:34,105 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 97 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1106 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-01-09 03:53:34,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1106 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2025-01-09 03:53:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5488. [2025-01-09 03:53:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5488 states, 4484 states have (on average 1.628456735057984) internal successors, (7302), 4491 states have internal predecessors, (7302), 976 states have call successors, (976), 25 states have call predecessors, (976), 27 states have return successors, (1091), 973 states have call predecessors, (1091), 973 states have call successors, (1091) [2025-01-09 03:53:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 9369 transitions. [2025-01-09 03:53:34,405 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 9369 transitions. Word has length 153 [2025-01-09 03:53:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:34,406 INFO L471 AbstractCegarLoop]: Abstraction has 5488 states and 9369 transitions. [2025-01-09 03:53:34,406 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 9369 transitions. [2025-01-09 03:53:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:53:34,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:34,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:34,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:53:34,432 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:34,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1650609481, now seen corresponding path program 1 times [2025-01-09 03:53:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856225696] [2025-01-09 03:53:34,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:34,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:53:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:53:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:34,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856225696] [2025-01-09 03:53:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856225696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562890093] [2025-01-09 03:53:34,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:34,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:34,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:34,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:34,513 INFO L87 Difference]: Start difference. First operand 5488 states and 9369 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:34,798 INFO L93 Difference]: Finished difference Result 13473 states and 23145 transitions. [2025-01-09 03:53:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:34,798 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-01-09 03:53:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:34,870 INFO L225 Difference]: With dead ends: 13473 [2025-01-09 03:53:34,870 INFO L226 Difference]: Without dead ends: 9085 [2025-01-09 03:53:34,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:34,892 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 95 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1086 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-01-09 03:53:34,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2025-01-09 03:53:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 9077. [2025-01-09 03:53:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9077 states, 7467 states have (on average 1.6276951921789207) internal successors, (12154), 7474 states have internal predecessors, (12154), 1582 states have call successors, (1582), 25 states have call predecessors, (1582), 27 states have return successors, (1775), 1579 states have call predecessors, (1775), 1579 states have call successors, (1775) [2025-01-09 03:53:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9077 states to 9077 states and 15511 transitions. [2025-01-09 03:53:35,346 INFO L78 Accepts]: Start accepts. Automaton has 9077 states and 15511 transitions. Word has length 154 [2025-01-09 03:53:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:35,346 INFO L471 AbstractCegarLoop]: Abstraction has 9077 states and 15511 transitions. [2025-01-09 03:53:35,347 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9077 states and 15511 transitions. [2025-01-09 03:53:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:53:35,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:35,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:35,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:53:35,384 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:35,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1413089498, now seen corresponding path program 1 times [2025-01-09 03:53:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231416836] [2025-01-09 03:53:35,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:35,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:53:35,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:53:35,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:35,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:35,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231416836] [2025-01-09 03:53:35,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231416836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:35,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:35,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:35,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170201550] [2025-01-09 03:53:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:35,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:35,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:35,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:35,446 INFO L87 Difference]: Start difference. First operand 9077 states and 15511 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:35,849 INFO L93 Difference]: Finished difference Result 23419 states and 40172 transitions. [2025-01-09 03:53:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:35,849 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2025-01-09 03:53:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:35,911 INFO L225 Difference]: With dead ends: 23419 [2025-01-09 03:53:35,912 INFO L226 Difference]: Without dead ends: 15872 [2025-01-09 03:53:35,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:35,945 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 93 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1093 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-01-09 03:53:35,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1093 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15872 states. [2025-01-09 03:53:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15872 to 15864. [2025-01-09 03:53:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15864 states, 13051 states have (on average 1.6190330242893265) internal successors, (21130), 13058 states have internal predecessors, (21130), 2785 states have call successors, (2785), 25 states have call predecessors, (2785), 27 states have return successors, (3122), 2782 states have call predecessors, (3122), 2782 states have call successors, (3122) [2025-01-09 03:53:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15864 states to 15864 states and 27037 transitions. [2025-01-09 03:53:36,547 INFO L78 Accepts]: Start accepts. Automaton has 15864 states and 27037 transitions. Word has length 155 [2025-01-09 03:53:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 15864 states and 27037 transitions. [2025-01-09 03:53:36,548 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 15864 states and 27037 transitions. [2025-01-09 03:53:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:53:36,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:36,598 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:53:36,599 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:36,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1465455720, now seen corresponding path program 1 times [2025-01-09 03:53:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782076422] [2025-01-09 03:53:36,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:36,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:53:36,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:53:36,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:36,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:36,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782076422] [2025-01-09 03:53:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782076422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348409177] [2025-01-09 03:53:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:36,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:36,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:36,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:36,671 INFO L87 Difference]: Start difference. First operand 15864 states and 27037 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:37,440 INFO L93 Difference]: Finished difference Result 41945 states and 71791 transitions. [2025-01-09 03:53:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:37,440 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2025-01-09 03:53:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:37,561 INFO L225 Difference]: With dead ends: 41945 [2025-01-09 03:53:37,561 INFO L226 Difference]: Without dead ends: 28224 [2025-01-09 03:53:37,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:37,623 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 91 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1086 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-01-09 03:53:37,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28224 states. [2025-01-09 03:53:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28224 to 28216. [2025-01-09 03:53:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28216 states, 23364 states have (on average 1.6149203903441192) internal successors, (37731), 23371 states have internal predecessors, (37731), 4824 states have call successors, (4824), 25 states have call predecessors, (4824), 27 states have return successors, (5435), 4821 states have call predecessors, (5435), 4821 states have call successors, (5435) [2025-01-09 03:53:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28216 states to 28216 states and 47990 transitions. [2025-01-09 03:53:38,935 INFO L78 Accepts]: Start accepts. Automaton has 28216 states and 47990 transitions. Word has length 156 [2025-01-09 03:53:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:38,935 INFO L471 AbstractCegarLoop]: Abstraction has 28216 states and 47990 transitions. [2025-01-09 03:53:38,936 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28216 states and 47990 transitions. [2025-01-09 03:53:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:53:38,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:38,992 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:38,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:53:38,993 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:38,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1242665096, now seen corresponding path program 1 times [2025-01-09 03:53:38,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:38,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463473031] [2025-01-09 03:53:38,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:38,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:39,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:53:39,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:53:39,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:39,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:39,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:39,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463473031] [2025-01-09 03:53:39,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463473031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:39,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:39,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926437655] [2025-01-09 03:53:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:39,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:39,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:39,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:39,052 INFO L87 Difference]: Start difference. First operand 28216 states and 47990 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:40,084 INFO L93 Difference]: Finished difference Result 76872 states and 131183 transitions. [2025-01-09 03:53:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:40,085 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2025-01-09 03:53:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:40,322 INFO L225 Difference]: With dead ends: 76872 [2025-01-09 03:53:40,322 INFO L226 Difference]: Without dead ends: 51534 [2025-01-09 03:53:40,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:40,390 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 89 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1087 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-01-09 03:53:40,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1087 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51534 states. [2025-01-09 03:53:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51534 to 51526. [2025-01-09 03:53:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51526 states, 42959 states have (on average 1.6092320584743594) internal successors, (69131), 42966 states have internal predecessors, (69131), 8539 states have call successors, (8539), 25 states have call predecessors, (8539), 27 states have return successors, (9682), 8536 states have call predecessors, (9682), 8536 states have call successors, (9682) [2025-01-09 03:53:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51526 states to 51526 states and 87352 transitions. [2025-01-09 03:53:42,445 INFO L78 Accepts]: Start accepts. Automaton has 51526 states and 87352 transitions. Word has length 157 [2025-01-09 03:53:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:42,446 INFO L471 AbstractCegarLoop]: Abstraction has 51526 states and 87352 transitions. [2025-01-09 03:53:42,446 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 51526 states and 87352 transitions. [2025-01-09 03:53:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 03:53:42,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:42,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:42,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:53:42,512 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:42,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1852693496, now seen corresponding path program 1 times [2025-01-09 03:53:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:42,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370310623] [2025-01-09 03:53:42,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:42,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:53:42,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:53:42,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:42,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:53:42,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370310623] [2025-01-09 03:53:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370310623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:42,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384405901] [2025-01-09 03:53:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:42,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:42,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:42,569 INFO L87 Difference]: Start difference. First operand 51526 states and 87352 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:44,832 INFO L93 Difference]: Finished difference Result 96124 states and 163282 transitions. [2025-01-09 03:53:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2025-01-09 03:53:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:45,150 INFO L225 Difference]: With dead ends: 96124 [2025-01-09 03:53:45,150 INFO L226 Difference]: Without dead ends: 95905 [2025-01-09 03:53:45,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:45,194 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 84 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1092 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-01-09 03:53:45,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1092 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95905 states. [2025-01-09 03:53:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95905 to 95897. [2025-01-09 03:53:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95897 states, 80531 states have (on average 1.6020290322981212) internal successors, (129013), 80538 states have internal predecessors, (129013), 15338 states have call successors, (15338), 25 states have call predecessors, (15338), 27 states have return successors, (17527), 15335 states have call predecessors, (17527), 15335 states have call successors, (17527) [2025-01-09 03:53:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95897 states to 95897 states and 161878 transitions. [2025-01-09 03:53:48,311 INFO L78 Accepts]: Start accepts. Automaton has 95897 states and 161878 transitions. Word has length 158 [2025-01-09 03:53:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:48,311 INFO L471 AbstractCegarLoop]: Abstraction has 95897 states and 161878 transitions. [2025-01-09 03:53:48,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:53:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 95897 states and 161878 transitions. [2025-01-09 03:53:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:53:48,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:48,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 03:53:48,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:53:48,979 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:48,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1834818343, now seen corresponding path program 1 times [2025-01-09 03:53:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299379415] [2025-01-09 03:53:48,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:48,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:53:49,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:53:49,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:49,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:53:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299379415] [2025-01-09 03:53:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299379415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875111417] [2025-01-09 03:53:49,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:49,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:49,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:49,406 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:49,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:53:49,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:53:49,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:53:49,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:49,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:49,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:53:49,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:53:49,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:53:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:53:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875111417] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:53:50,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:53:50,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-01-09 03:53:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735909643] [2025-01-09 03:53:50,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:53:50,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:53:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:50,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:53:50,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:53:50,202 INFO L87 Difference]: Start difference. First operand 95897 states and 161878 transitions. Second operand has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 9 states have call successors, (50), 8 states have call predecessors, (50), 12 states have return successors, (44), 11 states have call predecessors, (44), 9 states have call successors, (44) [2025-01-09 03:54:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:04,992 INFO L93 Difference]: Finished difference Result 382727 states and 669931 transitions. [2025-01-09 03:54:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-01-09 03:54:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 9 states have call successors, (50), 8 states have call predecessors, (50), 12 states have return successors, (44), 11 states have call predecessors, (44), 9 states have call successors, (44) Word has length 159 [2025-01-09 03:54:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:06,752 INFO L225 Difference]: With dead ends: 382727 [2025-01-09 03:54:06,753 INFO L226 Difference]: Without dead ends: 382512 [2025-01-09 03:54:06,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3484 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-01-09 03:54:06,958 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 6150 mSDsluCounter, 4687 mSDsCounter, 0 mSdLazyCounter, 11935 mSolverCounterSat, 2162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6211 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 14097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2162 IncrementalHoareTripleChecker+Valid, 11935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:06,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6211 Valid, 4918 Invalid, 14097 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2162 Valid, 11935 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 03:54:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382512 states.