./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product30.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 c6648e04749112dcff3ed26da66b003a84ec072cad34992d8bd41fd0d54f135f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:46:33,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:46:33,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:46:33,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:46:33,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:46:33,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:46:33,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:46:33,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:46:33,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:46:33,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:46:33,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:46:33,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:46:33,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:46:33,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:46:33,849 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:46:33,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:46:33,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:46:33,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:46:33,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:46:33,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:46:33,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:46:33,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:46:33,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:46:33,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:46:33,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:46:33,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:33,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:46:33,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:46:33,852 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:46:33,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:46:33,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:46:33,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:46:33,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:46:33,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:46:33,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:46:33,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:46:33,853 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 -> c6648e04749112dcff3ed26da66b003a84ec072cad34992d8bd41fd0d54f135f [2025-02-05 15:46:34,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:46:34,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:46:34,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:46:34,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:46:34,126 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:46:34,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product30.cil.c [2025-02-05 15:46:35,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4441ca83/e60c5d91a61d49cda6141efcc6d58938/FLAG6538a62e6 [2025-02-05 15:46:35,943 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:46:35,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product30.cil.c [2025-02-05 15:46:35,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4441ca83/e60c5d91a61d49cda6141efcc6d58938/FLAG6538a62e6 [2025-02-05 15:46:35,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4441ca83/e60c5d91a61d49cda6141efcc6d58938 [2025-02-05 15:46:35,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:46:35,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:46:36,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:36,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:46:36,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:46:36,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:35" (1/1) ... [2025-02-05 15:46:36,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e48f2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36, skipping insertion in model container [2025-02-05 15:46:36,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:35" (1/1) ... [2025-02-05 15:46:36,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:46:36,630 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_spec6_product30.cil.c[64728,64741] [2025-02-05 15:46:36,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:36,651 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:46:36,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-02-05 15:46:36,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [273] [2025-02-05 15:46:36,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [322] [2025-02-05 15:46:36,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1402] [2025-02-05 15:46:36,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [1814] [2025-02-05 15:46:36,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1864] [2025-02-05 15:46:36,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1881] [2025-02-05 15:46:36,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2245] [2025-02-05 15:46:36,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2381] [2025-02-05 15:46:36,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2747] [2025-02-05 15:46:36,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3022] [2025-02-05 15:46:36,789 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_spec6_product30.cil.c[64728,64741] [2025-02-05 15:46:36,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:36,822 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:46:36,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36 WrapperNode [2025-02-05 15:46:36,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:36,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:36,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:46:36,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:46:36,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:36,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:36,898 INFO L138 Inliner]: procedures = 132, calls = 209, calls flagged for inlining = 61, calls inlined = 51, statements flattened = 935 [2025-02-05 15:46:36,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:36,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:46:36,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:46:36,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:46:36,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:36,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:36,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:36,966 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:46:36,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:36,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:36,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:37,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:37,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:37,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:37,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:46:37,027 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:46:37,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:46:37,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:46:37,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (1/1) ... [2025-02-05 15:46:37,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:37,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:46:37,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:46:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:46:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:46:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:46:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:46:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:46:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:46:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:46:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:46:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:46:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:46:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:46:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:46:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:46:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:46:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:46:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:46:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:46:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:46:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:46:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:46:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:46:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:46:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:46:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:46:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:46:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:46:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:46:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:46:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:46:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:46:37,324 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:46:37,326 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:46:37,677 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L897-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~10#1; [2025-02-05 15:46:37,678 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1379-1: getClientId_#res#1 := getClientId_~retValue_acc~18#1; [2025-02-05 15:46:37,689 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: #res := ~retValue_acc~27; [2025-02-05 15:46:37,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2148: #res := ~retValue_acc~35; [2025-02-05 15:46:37,751 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~12#1; [2025-02-05 15:46:37,753 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: #res#1 := ~retValue_acc~13#1; [2025-02-05 15:46:37,790 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: #res := ~retValue_acc~16; [2025-02-05 15:46:37,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L944: #res := ~retValue_acc~11; [2025-02-05 15:46:37,815 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2378-1: createEmail_#res#1 := createEmail_~retValue_acc~39#1; [2025-02-05 15:46:37,832 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: #res := ~retValue_acc~25; [2025-02-05 15:46:37,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1684: #res := ~retValue_acc~26; [2025-02-05 15:46:37,857 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1758: #res := ~retValue_acc~28; [2025-02-05 15:46:37,883 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1532: #res := ~retValue_acc~22; [2025-02-05 15:46:38,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L319-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:46:38,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2105-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~32#1; [2025-02-05 15:46:38,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2114-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~33#1; [2025-02-05 15:46:38,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1206-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~15#1; [2025-02-05 15:46:38,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2123-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~34#1; [2025-02-05 15:46:38,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1099-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~14#1; [2025-02-05 15:46:38,224 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1495: #res := ~retValue_acc~21; [2025-02-05 15:46:38,233 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2334-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~36#1; [2025-02-05 15:46:38,233 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: #res#1 := ~retValue_acc~37#1; [2025-02-05 15:46:38,389 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-02-05 15:46:38,390 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:46:38,414 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:46:38,416 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:46:38,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:38 BoogieIcfgContainer [2025-02-05 15:46:38,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:46:38,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:46:38,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:46:38,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:46:38,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:46:35" (1/3) ... [2025-02-05 15:46:38,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3a30b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:38, skipping insertion in model container [2025-02-05 15:46:38,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:36" (2/3) ... [2025-02-05 15:46:38,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3a30b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:38, skipping insertion in model container [2025-02-05 15:46:38,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:38" (3/3) ... [2025-02-05 15:46:38,427 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product30.cil.c [2025-02-05 15:46:38,441 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:46:38,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product30.cil.c that has 24 procedures, 351 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:46:38,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:46:38,550 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;@1f7b8cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:46:38,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:46:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 271 states have (on average 1.5092250922509225) internal successors, (409), 275 states have internal predecessors, (409), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 15:46:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:46:38,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:38,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:46:38,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1042470125, now seen corresponding path program 1 times [2025-02-05 15:46:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660559044] [2025-02-05 15:46:38,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:38,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:46:38,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:46:38,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:38,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:46:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660559044] [2025-02-05 15:46:39,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660559044] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:39,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960180998] [2025-02-05 15:46:39,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:39,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:39,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:39,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:39,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:46:39,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:46:39,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:46:39,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:39,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:39,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:46:39,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:46:39,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960180998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:39,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:39,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:46:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505433211] [2025-02-05 15:46:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:46:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:39,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:46:39,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:39,817 INFO L87 Difference]: Start difference. First operand has 351 states, 271 states have (on average 1.5092250922509225) internal successors, (409), 275 states have internal predecessors, (409), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:39,873 INFO L93 Difference]: Finished difference Result 549 states and 794 transitions. [2025-02-05 15:46:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:46:39,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-02-05 15:46:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:39,898 INFO L225 Difference]: With dead ends: 549 [2025-02-05 15:46:39,898 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 15:46:39,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:39,907 INFO L435 NwaCegarLoop]: 516 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, 516 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:39,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 15:46:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-05 15:46:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 265 states have (on average 1.5056603773584907) internal successors, (399), 268 states have internal predecessors, (399), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 15:46:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 508 transitions. [2025-02-05 15:46:39,982 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 508 transitions. Word has length 126 [2025-02-05 15:46:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:39,983 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 508 transitions. [2025-02-05 15:46:39,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 508 transitions. [2025-02-05 15:46:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:46:39,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:39,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02-05 15:46:39,999 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-02-05 15:46:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:46:40,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:40,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 315270333, now seen corresponding path program 1 times [2025-02-05 15:46:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:40,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510250605] [2025-02-05 15:46:40,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:40,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:46:40,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:46:40,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:40,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:46:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510250605] [2025-02-05 15:46:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510250605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323074509] [2025-02-05 15:46:40,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:40,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:40,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:46:40,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:46:40,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:46:40,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:40,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:40,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:46:40,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:46:41,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323074509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:41,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:41,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956164806] [2025-02-05 15:46:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:41,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:41,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:41,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:41,006 INFO L87 Difference]: Start difference. First operand 344 states and 508 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:41,066 INFO L93 Difference]: Finished difference Result 538 states and 775 transitions. [2025-02-05 15:46:41,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:41,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2025-02-05 15:46:41,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:41,073 INFO L225 Difference]: With dead ends: 538 [2025-02-05 15:46:41,074 INFO L226 Difference]: Without dead ends: 346 [2025-02-05 15:46:41,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:41,078 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:41,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-02-05 15:46:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-02-05 15:46:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 267 states have (on average 1.5018726591760299) internal successors, (401), 270 states have internal predecessors, (401), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 15:46:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 510 transitions. [2025-02-05 15:46:41,117 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 510 transitions. Word has length 127 [2025-02-05 15:46:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:41,119 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 510 transitions. [2025-02-05 15:46:41,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 510 transitions. [2025-02-05 15:46:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:46:41,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:41,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02-05 15:46:41,135 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-02-05 15:46:41,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:41,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:41,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1965813611, now seen corresponding path program 1 times [2025-02-05 15:46:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822892568] [2025-02-05 15:46:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:41,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:46:41,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:46:41,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:41,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:41,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:41,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822892568] [2025-02-05 15:46:41,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822892568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:41,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110085823] [2025-02-05 15:46:41,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:41,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:41,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:41,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:41,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:46:41,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:46:42,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:46:42,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:42,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:42,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:42,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:46:42,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110085823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994751986] [2025-02-05 15:46:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:42,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:42,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:42,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:42,054 INFO L87 Difference]: Start difference. First operand 346 states and 510 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:42,092 INFO L93 Difference]: Finished difference Result 721 states and 1078 transitions. [2025-02-05 15:46:42,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-05 15:46:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:42,099 INFO L225 Difference]: With dead ends: 721 [2025-02-05 15:46:42,100 INFO L226 Difference]: Without dead ends: 402 [2025-02-05 15:46:42,103 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-02-05 15:46:42,104 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 107 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:42,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 973 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-05 15:46:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2025-02-05 15:46:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 304 states have (on average 1.519736842105263) internal successors, (462), 307 states have internal predecessors, (462), 66 states have call successors, (66), 23 states have call predecessors, (66), 23 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-05 15:46:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 593 transitions. [2025-02-05 15:46:42,140 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 593 transitions. Word has length 135 [2025-02-05 15:46:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:42,141 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 593 transitions. [2025-02-05 15:46:42,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 593 transitions. [2025-02-05 15:46:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:46:42,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:42,145 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02-05 15:46:42,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:42,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:42,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1515477947, now seen corresponding path program 1 times [2025-02-05 15:46:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735448506] [2025-02-05 15:46:42,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:46:42,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:46:42,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:42,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735448506] [2025-02-05 15:46:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735448506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798363970] [2025-02-05 15:46:42,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:42,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:42,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:42,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:42,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:46:42,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:46:42,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:46:42,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:42,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:42,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:46:42,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:46:42,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798363970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:42,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:42,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:46:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328063544] [2025-02-05 15:46:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:42,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:42,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:42,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:42,945 INFO L87 Difference]: Start difference. First operand 394 states and 593 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:43,031 INFO L93 Difference]: Finished difference Result 779 states and 1176 transitions. [2025-02-05 15:46:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:43,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2025-02-05 15:46:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:43,037 INFO L225 Difference]: With dead ends: 779 [2025-02-05 15:46:43,037 INFO L226 Difference]: Without dead ends: 396 [2025-02-05 15:46:43,039 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-02-05 15:46:43,043 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 2 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:43,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1989 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-05 15:46:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-02-05 15:46:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 305 states have (on average 1.518032786885246) internal successors, (463), 309 states have internal predecessors, (463), 66 states have call successors, (66), 23 states have call predecessors, (66), 24 states have return successors, (67), 65 states have call predecessors, (67), 65 states have call successors, (67) [2025-02-05 15:46:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 596 transitions. [2025-02-05 15:46:43,070 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 596 transitions. Word has length 136 [2025-02-05 15:46:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:43,071 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 596 transitions. [2025-02-05 15:46:43,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 596 transitions. [2025-02-05 15:46:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:46:43,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:43,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-02-05 15:46:43,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:46:43,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:43,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:43,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1683304363, now seen corresponding path program 1 times [2025-02-05 15:46:43,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:43,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84786422] [2025-02-05 15:46:43,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:43,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:46:43,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:46:43,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:43,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:46:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84786422] [2025-02-05 15:46:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84786422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688236644] [2025-02-05 15:46:43,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:43,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:43,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:43,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:43,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:46:43,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:46:43,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:46:43,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:43,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:43,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:46:43,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:46:43,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688236644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:43,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:46:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63868473] [2025-02-05 15:46:43,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:43,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:43,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:43,870 INFO L87 Difference]: Start difference. First operand 396 states and 596 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:43,961 INFO L93 Difference]: Finished difference Result 781 states and 1181 transitions. [2025-02-05 15:46:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:43,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 137 [2025-02-05 15:46:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:43,968 INFO L225 Difference]: With dead ends: 781 [2025-02-05 15:46:43,968 INFO L226 Difference]: Without dead ends: 398 [2025-02-05 15:46:43,969 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-02-05 15:46:43,970 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 2 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:43,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1975 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-05 15:46:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-02-05 15:46:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 306 states have (on average 1.5163398692810457) internal successors, (464), 311 states have internal predecessors, (464), 66 states have call successors, (66), 23 states have call predecessors, (66), 25 states have return successors, (72), 65 states have call predecessors, (72), 65 states have call successors, (72) [2025-02-05 15:46:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 602 transitions. [2025-02-05 15:46:43,996 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 602 transitions. Word has length 137 [2025-02-05 15:46:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:43,996 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 602 transitions. [2025-02-05 15:46:43,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 602 transitions. [2025-02-05 15:46:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:46:43,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:43,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:44,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:46:44,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:44,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:44,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash -135361651, now seen corresponding path program 1 times [2025-02-05 15:46:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:44,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426698755] [2025-02-05 15:46:44,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:44,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:44,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:46:44,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:46:44,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:44,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:44,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426698755] [2025-02-05 15:46:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426698755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:44,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252752321] [2025-02-05 15:46:44,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:44,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:44,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:44,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:44,360 INFO L87 Difference]: Start difference. First operand 398 states and 602 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:44,418 INFO L93 Difference]: Finished difference Result 773 states and 1172 transitions. [2025-02-05 15:46:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 138 [2025-02-05 15:46:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:44,423 INFO L225 Difference]: With dead ends: 773 [2025-02-05 15:46:44,423 INFO L226 Difference]: Without dead ends: 398 [2025-02-05 15:46:44,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:44,426 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 2 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:44,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1993 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-05 15:46:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-02-05 15:46:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 306 states have (on average 1.5163398692810457) internal successors, (464), 311 states have internal predecessors, (464), 66 states have call successors, (66), 23 states have call predecessors, (66), 25 states have return successors, (71), 65 states have call predecessors, (71), 65 states have call successors, (71) [2025-02-05 15:46:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 601 transitions. [2025-02-05 15:46:44,461 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 601 transitions. Word has length 138 [2025-02-05 15:46:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:44,462 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 601 transitions. [2025-02-05 15:46:44,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 601 transitions. [2025-02-05 15:46:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:46:44,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:44,464 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:44,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:46:44,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 448314565, now seen corresponding path program 2 times [2025-02-05 15:46:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718462960] [2025-02-05 15:46:44,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:46:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:44,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-02-05 15:46:44,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:46:44,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:46:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:46:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718462960] [2025-02-05 15:46:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718462960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:44,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877359495] [2025-02-05 15:46:44,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:44,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:44,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:44,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:44,653 INFO L87 Difference]: Start difference. First operand 398 states and 601 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:44,715 INFO L93 Difference]: Finished difference Result 771 states and 1167 transitions. [2025-02-05 15:46:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:44,716 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2025-02-05 15:46:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:44,724 INFO L225 Difference]: With dead ends: 771 [2025-02-05 15:46:44,724 INFO L226 Difference]: Without dead ends: 398 [2025-02-05 15:46:44,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:44,726 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 2 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:44,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1979 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-05 15:46:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-02-05 15:46:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 306 states have (on average 1.5163398692810457) internal successors, (464), 311 states have internal predecessors, (464), 66 states have call successors, (66), 23 states have call predecessors, (66), 25 states have return successors, (70), 65 states have call predecessors, (70), 65 states have call successors, (70) [2025-02-05 15:46:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 600 transitions. [2025-02-05 15:46:44,750 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 600 transitions. Word has length 139 [2025-02-05 15:46:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 600 transitions. [2025-02-05 15:46:44,751 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 600 transitions. [2025-02-05 15:46:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:46:44,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:44,755 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] [2025-02-05 15:46:44,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:46:44,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:44,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 161262683, now seen corresponding path program 3 times [2025-02-05 15:46:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039982745] [2025-02-05 15:46:44,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:46:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:44,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 140 statements into 3 equivalence classes. [2025-02-05 15:46:44,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 128 of 140 statements. [2025-02-05 15:46:44,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:46:44,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:46:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039982745] [2025-02-05 15:46:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039982745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:44,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:44,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164867039] [2025-02-05 15:46:44,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:44,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:44,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:44,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:44,916 INFO L87 Difference]: Start difference. First operand 398 states and 600 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:44,980 INFO L93 Difference]: Finished difference Result 773 states and 1173 transitions. [2025-02-05 15:46:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:44,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 140 [2025-02-05 15:46:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:44,985 INFO L225 Difference]: With dead ends: 773 [2025-02-05 15:46:44,986 INFO L226 Difference]: Without dead ends: 400 [2025-02-05 15:46:44,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:44,988 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:44,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1990 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-05 15:46:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-05 15:46:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 307 states have (on average 1.514657980456026) internal successors, (465), 313 states have internal predecessors, (465), 66 states have call successors, (66), 23 states have call predecessors, (66), 26 states have return successors, (75), 65 states have call predecessors, (75), 65 states have call successors, (75) [2025-02-05 15:46:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 606 transitions. [2025-02-05 15:46:45,011 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 606 transitions. Word has length 140 [2025-02-05 15:46:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:45,012 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 606 transitions. [2025-02-05 15:46:45,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2025-02-05 15:46:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:46:45,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:45,016 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:45,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:46:45,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:45,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2131653598, now seen corresponding path program 1 times [2025-02-05 15:46:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:45,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715599896] [2025-02-05 15:46:45,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:45,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:46:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:46:45,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:46:45,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:45,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715599896] [2025-02-05 15:46:45,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715599896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:45,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:45,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427207436] [2025-02-05 15:46:45,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:45,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:45,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:45,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:45,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:45,216 INFO L87 Difference]: Start difference. First operand 400 states and 606 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:45,268 INFO L93 Difference]: Finished difference Result 779 states and 1183 transitions. [2025-02-05 15:46:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 141 [2025-02-05 15:46:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:45,271 INFO L225 Difference]: With dead ends: 779 [2025-02-05 15:46:45,271 INFO L226 Difference]: Without dead ends: 402 [2025-02-05 15:46:45,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:45,275 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:45,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1996 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-05 15:46:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-02-05 15:46:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 308 states have (on average 1.5129870129870129) internal successors, (466), 315 states have internal predecessors, (466), 66 states have call successors, (66), 23 states have call predecessors, (66), 27 states have return successors, (77), 65 states have call predecessors, (77), 65 states have call successors, (77) [2025-02-05 15:46:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 609 transitions. [2025-02-05 15:46:45,297 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 609 transitions. Word has length 141 [2025-02-05 15:46:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:45,297 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 609 transitions. [2025-02-05 15:46:45,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:46:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 609 transitions. [2025-02-05 15:46:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:46:45,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:45,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:45,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:46:45,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:45,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash -178380921, now seen corresponding path program 1 times [2025-02-05 15:46:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:45,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851929551] [2025-02-05 15:46:45,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:45,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:46:45,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:46:45,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:45,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:46:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:45,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851929551] [2025-02-05 15:46:45,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851929551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:45,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691591644] [2025-02-05 15:46:45,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:45,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:45,505 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:45,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:46:45,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:46:45,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:46:45,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:45,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:45,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:45,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:46:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691591644] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:46:45,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:46:45,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:46:45,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015004693] [2025-02-05 15:46:45,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:46:45,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:46:45,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:45,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:46:45,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:45,998 INFO L87 Difference]: Start difference. First operand 402 states and 609 transitions. Second operand has 11 states, 10 states have (on average 14.5) internal successors, (145), 11 states have internal predecessors, (145), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-05 15:46:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:46,702 INFO L93 Difference]: Finished difference Result 1124 states and 1783 transitions. [2025-02-05 15:46:46,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:46:46,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.5) internal successors, (145), 11 states have internal predecessors, (145), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 142 [2025-02-05 15:46:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:46,708 INFO L225 Difference]: With dead ends: 1124 [2025-02-05 15:46:46,709 INFO L226 Difference]: Without dead ends: 751 [2025-02-05 15:46:46,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:46:46,711 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1115 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:46,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 3945 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:46:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-05 15:46:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 727. [2025-02-05 15:46:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 569 states have (on average 1.571177504393673) internal successors, (894), 575 states have internal predecessors, (894), 130 states have call successors, (130), 24 states have call predecessors, (130), 27 states have return successors, (151), 129 states have call predecessors, (151), 129 states have call successors, (151) [2025-02-05 15:46:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1175 transitions. [2025-02-05 15:46:46,760 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1175 transitions. Word has length 142 [2025-02-05 15:46:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:46,760 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1175 transitions. [2025-02-05 15:46:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.5) internal successors, (145), 11 states have internal predecessors, (145), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-05 15:46:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1175 transitions. [2025-02-05 15:46:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:46:46,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:46,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:46:46,776 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-02-05 15:46:46,966 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,SelfDestructingSolverStorable9 [2025-02-05 15:46:46,967 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:46,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 533737900, now seen corresponding path program 1 times [2025-02-05 15:46:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:46,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520432566] [2025-02-05 15:46:46,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:46,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:46:47,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:46:47,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:47,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520432566] [2025-02-05 15:46:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520432566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660554832] [2025-02-05 15:46:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:47,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:47,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:47,050 INFO L87 Difference]: Start difference. First operand 727 states and 1175 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:47,107 INFO L93 Difference]: Finished difference Result 1679 states and 2763 transitions. [2025-02-05 15:46:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:47,108 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-02-05 15:46:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:47,116 INFO L225 Difference]: With dead ends: 1679 [2025-02-05 15:46:47,117 INFO L226 Difference]: Without dead ends: 1030 [2025-02-05 15:46:47,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:47,121 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 104 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:47,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1019 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-05 15:46:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1022. [2025-02-05 15:46:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 800 states have (on average 1.5925) internal successors, (1274), 806 states have internal predecessors, (1274), 194 states have call successors, (194), 24 states have call predecessors, (194), 27 states have return successors, (225), 193 states have call predecessors, (225), 193 states have call successors, (225) [2025-02-05 15:46:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1693 transitions. [2025-02-05 15:46:47,193 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1693 transitions. Word has length 145 [2025-02-05 15:46:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:47,194 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1693 transitions. [2025-02-05 15:46:47,194 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1693 transitions. [2025-02-05 15:46:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:46:47,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:47,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:46:47,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:46:47,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:47,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 888795029, now seen corresponding path program 1 times [2025-02-05 15:46:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174964679] [2025-02-05 15:46:47,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:47,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:46:47,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:46:47,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:47,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:47,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:47,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174964679] [2025-02-05 15:46:47,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174964679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:47,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:47,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:47,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145803288] [2025-02-05 15:46:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:47,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:47,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:47,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:47,279 INFO L87 Difference]: Start difference. First operand 1022 states and 1693 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:47,348 INFO L93 Difference]: Finished difference Result 2408 states and 4016 transitions. [2025-02-05 15:46:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:47,349 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-02-05 15:46:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:47,362 INFO L225 Difference]: With dead ends: 2408 [2025-02-05 15:46:47,362 INFO L226 Difference]: Without dead ends: 1515 [2025-02-05 15:46:47,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:47,367 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 102 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:47,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1016 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-02-05 15:46:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1507. [2025-02-05 15:46:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1190 states have (on average 1.6033613445378152) internal successors, (1908), 1196 states have internal predecessors, (1908), 289 states have call successors, (289), 24 states have call predecessors, (289), 27 states have return successors, (320), 288 states have call predecessors, (320), 288 states have call successors, (320) [2025-02-05 15:46:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2517 transitions. [2025-02-05 15:46:47,500 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2517 transitions. Word has length 146 [2025-02-05 15:46:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:47,502 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 2517 transitions. [2025-02-05 15:46:47,502 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2517 transitions. [2025-02-05 15:46:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:46:47,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:47,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:46:47,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:46:47,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:47,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 94483723, now seen corresponding path program 1 times [2025-02-05 15:46:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:47,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090015735] [2025-02-05 15:46:47,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:47,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:46:47,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:46:47,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:47,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:47,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090015735] [2025-02-05 15:46:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090015735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:47,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091258227] [2025-02-05 15:46:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:47,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:47,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:47,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:47,582 INFO L87 Difference]: Start difference. First operand 1507 states and 2517 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:47,682 INFO L93 Difference]: Finished difference Result 3492 states and 5882 transitions. [2025-02-05 15:46:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:47,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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2025-02-05 15:46:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:47,701 INFO L225 Difference]: With dead ends: 3492 [2025-02-05 15:46:47,701 INFO L226 Difference]: Without dead ends: 2246 [2025-02-05 15:46:47,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:47,709 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 100 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:47,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1003 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-02-05 15:46:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2238. [2025-02-05 15:46:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1798 states have (on average 1.6117908787541713) internal successors, (2898), 1804 states have internal predecessors, (2898), 412 states have call successors, (412), 24 states have call predecessors, (412), 27 states have return successors, (459), 411 states have call predecessors, (459), 411 states have call successors, (459) [2025-02-05 15:46:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3769 transitions. [2025-02-05 15:46:47,851 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3769 transitions. Word has length 147 [2025-02-05 15:46:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:47,852 INFO L471 AbstractCegarLoop]: Abstraction has 2238 states and 3769 transitions. [2025-02-05 15:46:47,852 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3769 transitions. [2025-02-05 15:46:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:46:47,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:47,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:46:47,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:46:47,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:47,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -895738410, now seen corresponding path program 1 times [2025-02-05 15:46:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:47,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57160478] [2025-02-05 15:46:47,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:47,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:46:47,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:46:47,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:47,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:47,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57160478] [2025-02-05 15:46:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57160478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:47,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:47,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852073765] [2025-02-05 15:46:47,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:47,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:47,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:47,961 INFO L87 Difference]: Start difference. First operand 2238 states and 3769 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:48,099 INFO L93 Difference]: Finished difference Result 5170 states and 8774 transitions. [2025-02-05 15:46:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:48,100 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2025-02-05 15:46:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:48,129 INFO L225 Difference]: With dead ends: 5170 [2025-02-05 15:46:48,129 INFO L226 Difference]: Without dead ends: 3408 [2025-02-05 15:46:48,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:48,140 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 98 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:48,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1003 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2025-02-05 15:46:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3400. [2025-02-05 15:46:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 2781 states have (on average 1.617403811578569) internal successors, (4498), 2787 states have internal predecessors, (4498), 591 states have call successors, (591), 24 states have call predecessors, (591), 27 states have return successors, (664), 590 states have call predecessors, (664), 590 states have call successors, (664) [2025-02-05 15:46:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 5753 transitions. [2025-02-05 15:46:48,376 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 5753 transitions. Word has length 148 [2025-02-05 15:46:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:48,377 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 5753 transitions. [2025-02-05 15:46:48,377 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 5753 transitions. [2025-02-05 15:46:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:46:48,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:48,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:46:48,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:46:48,402 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:48,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash -288853622, now seen corresponding path program 1 times [2025-02-05 15:46:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351305367] [2025-02-05 15:46:48,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:48,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:46:48,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:46:48,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:48,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:48,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351305367] [2025-02-05 15:46:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351305367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:48,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:48,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:48,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394828086] [2025-02-05 15:46:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:48,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:48,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:48,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:48,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:48,506 INFO L87 Difference]: Start difference. First operand 3400 states and 5753 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:48,750 INFO L93 Difference]: Finished difference Result 8187 states and 13934 transitions. [2025-02-05 15:46:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:48,750 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2025-02-05 15:46:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:48,789 INFO L225 Difference]: With dead ends: 8187 [2025-02-05 15:46:48,789 INFO L226 Difference]: Without dead ends: 5510 [2025-02-05 15:46:48,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:48,806 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 96 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:48,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1020 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2025-02-05 15:46:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 5502. [2025-02-05 15:46:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5502 states, 4507 states have (on average 1.6119369869092524) internal successors, (7265), 4513 states have internal predecessors, (7265), 967 states have call successors, (967), 24 states have call predecessors, (967), 27 states have return successors, (1084), 966 states have call predecessors, (1084), 966 states have call successors, (1084) [2025-02-05 15:46:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5502 states to 5502 states and 9316 transitions. [2025-02-05 15:46:49,153 INFO L78 Accepts]: Start accepts. Automaton has 5502 states and 9316 transitions. Word has length 149 [2025-02-05 15:46:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:49,154 INFO L471 AbstractCegarLoop]: Abstraction has 5502 states and 9316 transitions. [2025-02-05 15:46:49,154 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5502 states and 9316 transitions. [2025-02-05 15:46:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:46:49,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:49,185 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:46:49,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:46:49,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:49,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1900804951, now seen corresponding path program 1 times [2025-02-05 15:46:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415326338] [2025-02-05 15:46:49,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:49,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:46:49,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:46:49,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:49,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:49,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415326338] [2025-02-05 15:46:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415326338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:49,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:49,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053274144] [2025-02-05 15:46:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:49,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:49,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:49,255 INFO L87 Difference]: Start difference. First operand 5502 states and 9316 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:49,551 INFO L93 Difference]: Finished difference Result 13504 states and 23019 transitions. [2025-02-05 15:46:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:49,552 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-02-05 15:46:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:49,617 INFO L225 Difference]: With dead ends: 13504 [2025-02-05 15:46:49,617 INFO L226 Difference]: Without dead ends: 9121 [2025-02-05 15:46:49,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:49,637 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 94 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:49,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1016 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2025-02-05 15:46:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9113. [2025-02-05 15:46:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9113 states, 7512 states have (on average 1.6107561235356762) internal successors, (12100), 7518 states have internal predecessors, (12100), 1573 states have call successors, (1573), 24 states have call predecessors, (1573), 27 states have return successors, (1768), 1572 states have call predecessors, (1768), 1572 states have call successors, (1768) [2025-02-05 15:46:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9113 states to 9113 states and 15441 transitions. [2025-02-05 15:46:50,150 INFO L78 Accepts]: Start accepts. Automaton has 9113 states and 15441 transitions. Word has length 150 [2025-02-05 15:46:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:50,150 INFO L471 AbstractCegarLoop]: Abstraction has 9113 states and 15441 transitions. [2025-02-05 15:46:50,151 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 9113 states and 15441 transitions. [2025-02-05 15:46:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:46:50,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:50,196 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:46:50,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:46:50,197 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:50,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash 207476137, now seen corresponding path program 1 times [2025-02-05 15:46:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021107554] [2025-02-05 15:46:50,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:50,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:46:50,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:46:50,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:50,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021107554] [2025-02-05 15:46:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021107554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:50,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:50,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864460453] [2025-02-05 15:46:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:50,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:50,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:50,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:50,273 INFO L87 Difference]: Start difference. First operand 9113 states and 15441 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:50,853 INFO L93 Difference]: Finished difference Result 23486 states and 39977 transitions. [2025-02-05 15:46:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:50,855 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2025-02-05 15:46:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:50,947 INFO L225 Difference]: With dead ends: 23486 [2025-02-05 15:46:50,947 INFO L226 Difference]: Without dead ends: 15937 [2025-02-05 15:46:50,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:50,992 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 92 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:50,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1019 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15937 states. [2025-02-05 15:46:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15937 to 15929. [2025-02-05 15:46:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15929 states, 13125 states have (on average 1.6025142857142858) internal successors, (21033), 13131 states have internal predecessors, (21033), 2776 states have call successors, (2776), 24 states have call predecessors, (2776), 27 states have return successors, (3115), 2775 states have call predecessors, (3115), 2775 states have call successors, (3115) [2025-02-05 15:46:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15929 states to 15929 states and 26924 transitions. [2025-02-05 15:46:51,929 INFO L78 Accepts]: Start accepts. Automaton has 15929 states and 26924 transitions. Word has length 151 [2025-02-05 15:46:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:51,930 INFO L471 AbstractCegarLoop]: Abstraction has 15929 states and 26924 transitions. [2025-02-05 15:46:51,930 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 15929 states and 26924 transitions. [2025-02-05 15:46:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:46:51,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:51,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:46:51,994 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1404875160, now seen corresponding path program 1 times [2025-02-05 15:46:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404975538] [2025-02-05 15:46:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:52,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:52,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:52,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:52,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404975538] [2025-02-05 15:46:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404975538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061499151] [2025-02-05 15:46:52,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:52,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:52,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:52,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:52,059 INFO L87 Difference]: Start difference. First operand 15929 states and 26924 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:52,976 INFO L93 Difference]: Finished difference Result 42057 states and 71439 transitions. [2025-02-05 15:46:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:52,977 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-02-05 15:46:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:53,138 INFO L225 Difference]: With dead ends: 42057 [2025-02-05 15:46:53,139 INFO L226 Difference]: Without dead ends: 28326 [2025-02-05 15:46:53,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:53,203 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 90 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:53,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1006 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28326 states. [2025-02-05 15:46:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28326 to 28318. [2025-02-05 15:46:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28318 states, 23475 states have (on average 1.5988924387646433) internal successors, (37534), 23481 states have internal predecessors, (37534), 4815 states have call successors, (4815), 24 states have call predecessors, (4815), 27 states have return successors, (5428), 4814 states have call predecessors, (5428), 4814 states have call successors, (5428) [2025-02-05 15:46:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 47777 transitions. [2025-02-05 15:46:55,046 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 47777 transitions. Word has length 152 [2025-02-05 15:46:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:55,047 INFO L471 AbstractCegarLoop]: Abstraction has 28318 states and 47777 transitions. [2025-02-05 15:46:55,048 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 47777 transitions. [2025-02-05 15:46:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:46:55,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:55,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:55,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:46:55,161 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:55,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1303122152, now seen corresponding path program 1 times [2025-02-05 15:46:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:55,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106254630] [2025-02-05 15:46:55,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:55,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:46:55,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:46:55,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:55,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:55,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106254630] [2025-02-05 15:46:55,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106254630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:55,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:55,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:55,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372709295] [2025-02-05 15:46:55,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:55,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:55,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:55,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:55,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:55,265 INFO L87 Difference]: Start difference. First operand 28318 states and 47777 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:46:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:56,972 INFO L93 Difference]: Finished difference Result 77039 states and 130491 transitions. [2025-02-05 15:46:56,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:56,973 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2025-02-05 15:46:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:57,276 INFO L225 Difference]: With dead ends: 77039 [2025-02-05 15:46:57,277 INFO L226 Difference]: Without dead ends: 51682 [2025-02-05 15:46:57,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:57,375 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 88 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:57,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1008 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51682 states. [2025-02-05 15:46:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51682 to 51674. [2025-02-05 15:46:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51674 states, 43116 states have (on average 1.5937007143519808) internal successors, (68714), 43122 states have internal predecessors, (68714), 8530 states have call successors, (8530), 24 states have call predecessors, (8530), 27 states have return successors, (9675), 8529 states have call predecessors, (9675), 8529 states have call successors, (9675) [2025-02-05 15:47:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51674 states to 51674 states and 86919 transitions. [2025-02-05 15:47:00,172 INFO L78 Accepts]: Start accepts. Automaton has 51674 states and 86919 transitions. Word has length 153 [2025-02-05 15:47:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:00,173 INFO L471 AbstractCegarLoop]: Abstraction has 51674 states and 86919 transitions. [2025-02-05 15:47:00,173 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:47:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51674 states and 86919 transitions. [2025-02-05 15:47:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:47:00,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:00,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:00,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:47:00,292 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:00,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 549962873, now seen corresponding path program 1 times [2025-02-05 15:47:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952438926] [2025-02-05 15:47:00,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:00,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:47:00,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:47:00,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:00,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:00,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952438926] [2025-02-05 15:47:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952438926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:00,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:00,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943718321] [2025-02-05 15:47:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:00,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:00,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:00,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:00,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:00,378 INFO L87 Difference]: Start difference. First operand 51674 states and 86919 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:47:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:02,881 INFO L93 Difference]: Finished difference Result 96300 states and 162342 transitions. [2025-02-05 15:47:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-02-05 15:47:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:03,486 INFO L225 Difference]: With dead ends: 96300 [2025-02-05 15:47:03,487 INFO L226 Difference]: Without dead ends: 96108 [2025-02-05 15:47:03,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:03,681 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 83 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:03,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1020 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96108 states. [2025-02-05 15:47:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96108 to 96100. [2025-02-05 15:47:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96100 states, 80743 states have (on average 1.586862018998551) internal successors, (128128), 80749 states have internal predecessors, (128128), 15329 states have call successors, (15329), 24 states have call predecessors, (15329), 27 states have return successors, (17520), 15328 states have call predecessors, (17520), 15328 states have call successors, (17520) [2025-02-05 15:47:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96100 states to 96100 states and 160977 transitions. [2025-02-05 15:47:07,688 INFO L78 Accepts]: Start accepts. Automaton has 96100 states and 160977 transitions. Word has length 154 [2025-02-05 15:47:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:07,688 INFO L471 AbstractCegarLoop]: Abstraction has 96100 states and 160977 transitions. [2025-02-05 15:47:07,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:47:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 96100 states and 160977 transitions. [2025-02-05 15:47:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 15:47:08,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:08,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:08,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:47:08,054 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:08,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 704275431, now seen corresponding path program 1 times [2025-02-05 15:47:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512793571] [2025-02-05 15:47:08,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:08,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:47:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:47:08,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:47:08,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512793571] [2025-02-05 15:47:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512793571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048992287] [2025-02-05 15:47:08,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:08,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:08,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:08,429 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-02-05 15:47:08,431 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-02-05 15:47:08,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:47:08,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:47:08,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:08,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:08,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:47:08,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:47:09,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:47:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:47:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048992287] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:47:09,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:47:09,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-02-05 15:47:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981995841] [2025-02-05 15:47:09,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:47:09,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:47:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:09,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:47:09,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:47:09,445 INFO L87 Difference]: Start difference. First operand 96100 states and 160977 transitions. Second operand has 28 states, 26 states have (on average 9.576923076923077) internal successors, (249), 24 states have internal predecessors, (249), 9 states have call successors, (49), 8 states have call predecessors, (49), 12 states have return successors, (44), 11 states have call predecessors, (44), 9 states have call successors, (44) [2025-02-05 15:47:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:24,639 INFO L93 Difference]: Finished difference Result 383322 states and 666040 transitions. [2025-02-05 15:47:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-05 15:47:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.576923076923077) internal successors, (249), 24 states have internal predecessors, (249), 9 states have call successors, (49), 8 states have call predecessors, (49), 12 states have return successors, (44), 11 states have call predecessors, (44), 9 states have call successors, (44) Word has length 155 [2025-02-05 15:47:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:27,082 INFO L225 Difference]: With dead ends: 383322 [2025-02-05 15:47:27,082 INFO L226 Difference]: Without dead ends: 383134 [2025-02-05 15:47:27,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3483 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-02-05 15:47:27,253 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 5573 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 10377 mSolverCounterSat, 1697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5626 SdHoareTripleChecker+Valid, 5053 SdHoareTripleChecker+Invalid, 12074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1697 IncrementalHoareTripleChecker+Valid, 10377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:27,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5626 Valid, 5053 Invalid, 12074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1697 Valid, 10377 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-05 15:47:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383134 states.