./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product22.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_spec0_product22.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 646f5b113c7a3ad2f4a2522272ad1b8889776081b2b5bc43fffe0e887ddc48f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:39:53,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:39:53,943 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:39:53,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:39:53,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:39:53,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:39:53,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:39:53,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:39:53,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:39:53,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:39:53,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:39:53,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:39:53,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:39:53,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:39:53,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:39:53,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:39:53,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:39:53,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:39:53,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 646f5b113c7a3ad2f4a2522272ad1b8889776081b2b5bc43fffe0e887ddc48f7 [2025-02-05 15:39:54,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:39:54,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:39:54,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:39:54,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:39:54,226 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:39:54,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product22.cil.c [2025-02-05 15:39:55,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/601b9a20b/b33eaa3909c2452b87bf4677f0972c75/FLAGe76d91b2d [2025-02-05 15:39:55,836 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:39:55,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product22.cil.c [2025-02-05 15:39:55,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/601b9a20b/b33eaa3909c2452b87bf4677f0972c75/FLAGe76d91b2d [2025-02-05 15:39:56,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/601b9a20b/b33eaa3909c2452b87bf4677f0972c75 [2025-02-05 15:39:56,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:39:56,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:39:56,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:39:56,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:39:56,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:39:56,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab61f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56, skipping insertion in model container [2025-02-05 15:39:56,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:39:56,333 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_spec0_product22.cil.c[4724,4737] [2025-02-05 15:39:56,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:39:56,553 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:39:56,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-02-05 15:39:56,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [66] [2025-02-05 15:39:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [189] [2025-02-05 15:39:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [198] [2025-02-05 15:39:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [236] [2025-02-05 15:39:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [602] [2025-02-05 15:39:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1007] [2025-02-05 15:39:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1314] [2025-02-05 15:39:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1618] [2025-02-05 15:39:56,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1637] [2025-02-05 15:39:56,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2702] [2025-02-05 15:39:56,571 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_spec0_product22.cil.c[4724,4737] [2025-02-05 15:39:56,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:39:56,658 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:39:56,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56 WrapperNode [2025-02-05 15:39:56,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:39:56,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:39:56,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:39:56,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:39:56,663 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:39:56" (1/1) ... [2025-02-05 15:39:56,677 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:39:56" (1/1) ... [2025-02-05 15:39:56,703 INFO L138 Inliner]: procedures = 128, calls = 189, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1012 [2025-02-05 15:39:56,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:39:56,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:39:56,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:39:56,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:39:56,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,734 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:39:56,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:39:56,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:39:56,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:39:56,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:39:56,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (1/1) ... [2025-02-05 15:39:56,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:39:56,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:56,808 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:39:56,811 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:39:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:39:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:39:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:39:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:39:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:39:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:39:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:39:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:39:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:39:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:39:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:39:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:39:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:39:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:39:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:39:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:39:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:39:56,831 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:39:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:39:56,831 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:39:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:39:56,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:39:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:39:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:39:56,832 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:39:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:39:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:39:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:39:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:39:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:39:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:39:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:39:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:39:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:39:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:39:56,835 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:39:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:39:56,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:39:56,976 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:39:56,978 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:39:57,188 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-02-05 15:39:57,188 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~42#1; [2025-02-05 15:39:57,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2244-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~36#1; [2025-02-05 15:39:57,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L651-1: getEmailId_#res#1 := getEmailId_~retValue_acc~11#1; [2025-02-05 15:39:57,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~25#1; [2025-02-05 15:39:57,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2560-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~41#1; [2025-02-05 15:39:57,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~35#1; [2025-02-05 15:39:57,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2336: #res#1 := ~retValue_acc~38#1; [2025-02-05 15:39:57,216 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2291-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-02-05 15:39:57,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L186-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-02-05 15:39:57,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L840: #res := ~retValue_acc~16; [2025-02-05 15:39:57,254 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L877: #res := ~retValue_acc~17; [2025-02-05 15:39:57,274 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: #res := ~retValue_acc~13; [2025-02-05 15:39:57,530 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2506-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-02-05 15:39:57,530 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-02-05 15:39:57,531 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1228-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-02-05 15:39:57,531 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-02-05 15:39:57,531 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1246-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-02-05 15:39:57,531 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L233-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-02-05 15:39:57,538 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: #res := ~retValue_acc~12; [2025-02-05 15:39:57,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L142-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-02-05 15:39:57,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L162: #res#1 := ~retValue_acc~2#1; [2025-02-05 15:39:57,663 INFO L? ?]: Removed 430 outVars from TransFormulas that were not future-live. [2025-02-05 15:39:57,664 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:39:57,676 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:39:57,676 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:39:57,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:39:57 BoogieIcfgContainer [2025-02-05 15:39:57,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:39:57,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:39:57,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:39:57,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:39:57,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:39:56" (1/3) ... [2025-02-05 15:39:57,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a144eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:39:57, skipping insertion in model container [2025-02-05 15:39:57,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:56" (2/3) ... [2025-02-05 15:39:57,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a144eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:39:57, skipping insertion in model container [2025-02-05 15:39:57,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:39:57" (3/3) ... [2025-02-05 15:39:57,682 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product22.cil.c [2025-02-05 15:39:57,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:39:57,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product22.cil.c that has 20 procedures, 321 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:39:57,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:39:57,768 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;@7d258509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:39:57,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:39:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 321 states, 250 states have (on average 1.524) internal successors, (381), 254 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 15:39:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:39:57,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:57,788 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] [2025-02-05 15:39:57,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:57,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1449677803, now seen corresponding path program 1 times [2025-02-05 15:39:57,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313597071] [2025-02-05 15:39:57,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:57,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:57,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:39:57,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:39:57,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:57,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:58,377 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:39:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313597071] [2025-02-05 15:39:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313597071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056089895] [2025-02-05 15:39:58,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:58,380 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:39:58,382 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:39:58,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:39:58,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:39:58,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:58,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:58,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:39:58,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:58,680 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:39:58,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056089895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:39:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621007557] [2025-02-05 15:39:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:58,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:39:58,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:58,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:39:58,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:58,707 INFO L87 Difference]: Start difference. First operand has 321 states, 250 states have (on average 1.524) internal successors, (381), 254 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:39:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:58,756 INFO L93 Difference]: Finished difference Result 484 states and 710 transitions. [2025-02-05 15:39:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:39:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-02-05 15:39:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:58,774 INFO L225 Difference]: With dead ends: 484 [2025-02-05 15:39:58,775 INFO L226 Difference]: Without dead ends: 314 [2025-02-05 15:39:58,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 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:39:58,782 INFO L435 NwaCegarLoop]: 478 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, 478 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:39:58,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-05 15:39:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-02-05 15:39:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 244 states have (on average 1.5204918032786885) internal successors, (371), 247 states have internal predecessors, (371), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-05 15:39:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 470 transitions. [2025-02-05 15:39:58,851 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 470 transitions. Word has length 119 [2025-02-05 15:39:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:58,852 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 470 transitions. [2025-02-05 15:39:58,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:39:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 470 transitions. [2025-02-05 15:39:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:39:58,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:58,859 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] [2025-02-05 15:39:58,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:59,060 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:39:59,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:59,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 67417097, now seen corresponding path program 1 times [2025-02-05 15:39:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:59,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818180133] [2025-02-05 15:39:59,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:59,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:59,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:39:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:39:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:59,297 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:39:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818180133] [2025-02-05 15:39:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818180133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945673620] [2025-02-05 15:39:59,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:59,301 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:39:59,303 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:39:59,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:39:59,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:39:59,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:59,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:59,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:39:59,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:59,606 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:39:59,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945673620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:59,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:39:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320704969] [2025-02-05 15:39:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:59,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:59,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:59,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:59,608 INFO L87 Difference]: Start difference. First operand 314 states and 470 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:39:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:59,643 INFO L93 Difference]: Finished difference Result 473 states and 691 transitions. [2025-02-05 15:39:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:59,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-02-05 15:39:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:59,646 INFO L225 Difference]: With dead ends: 473 [2025-02-05 15:39:59,648 INFO L226 Difference]: Without dead ends: 316 [2025-02-05 15:39:59,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 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:39:59,649 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 936 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:39:59,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 936 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-02-05 15:39:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-02-05 15:39:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 246 states have (on average 1.516260162601626) internal successors, (373), 249 states have internal predecessors, (373), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-05 15:39:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2025-02-05 15:39:59,667 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 120 [2025-02-05 15:39:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:59,667 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2025-02-05 15:39:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:39:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2025-02-05 15:39:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:39:59,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:59,670 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] [2025-02-05 15:39:59,677 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:39:59,871 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:39:59,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:59,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1218756453, now seen corresponding path program 1 times [2025-02-05 15:39:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755233115] [2025-02-05 15:39:59,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:59,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:39:59,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:39:59,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:59,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:00,075 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:40:00,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755233115] [2025-02-05 15:40:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755233115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106068890] [2025-02-05 15:40:00,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:00,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:00,080 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:40:00,082 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:40:00,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:40:00,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:40:00,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:00,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:00,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:00,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:00,378 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:40:00,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106068890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:00,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301382062] [2025-02-05 15:40:00,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:00,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:00,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:00,383 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:00,424 INFO L93 Difference]: Finished difference Result 666 states and 1010 transitions. [2025-02-05 15:40:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-02-05 15:40:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:00,428 INFO L225 Difference]: With dead ends: 666 [2025-02-05 15:40:00,430 INFO L226 Difference]: Without dead ends: 377 [2025-02-05 15:40:00,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 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:40:00,433 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 115 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 905 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:40:00,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 905 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-05 15:40:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 369. [2025-02-05 15:40:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 288 states have (on average 1.5347222222222223) internal successors, (442), 291 states have internal predecessors, (442), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 15:40:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 563 transitions. [2025-02-05 15:40:00,465 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 563 transitions. Word has length 128 [2025-02-05 15:40:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:00,468 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 563 transitions. [2025-02-05 15:40:00,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 563 transitions. [2025-02-05 15:40:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:40:00,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:00,473 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] [2025-02-05 15:40:00,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:40:00,674 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:40:00,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:00,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash -744534217, now seen corresponding path program 1 times [2025-02-05 15:40:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705883291] [2025-02-05 15:40:00,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:00,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:40:00,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:40:00,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:00,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:00,858 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:40:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:00,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705883291] [2025-02-05 15:40:00,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705883291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815607043] [2025-02-05 15:40:00,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:00,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:00,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:00,862 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:40:00,866 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:40:01,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:40:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:40:01,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:01,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:01,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:40:01,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:01,182 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:40:01,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:01,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815607043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:01,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:40:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114695293] [2025-02-05 15:40:01,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:01,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:01,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:01,185 INFO L87 Difference]: Start difference. First operand 369 states and 563 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:01,281 INFO L93 Difference]: Finished difference Result 729 states and 1116 transitions. [2025-02-05 15:40:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2025-02-05 15:40:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:01,283 INFO L225 Difference]: With dead ends: 729 [2025-02-05 15:40:01,284 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 15:40:01,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 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:40:01,285 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1837 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:40:01,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1837 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 15:40:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-02-05 15:40:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 289 states have (on average 1.532871972318339) internal successors, (443), 293 states have internal predecessors, (443), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-02-05 15:40:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 566 transitions. [2025-02-05 15:40:01,297 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 566 transitions. Word has length 129 [2025-02-05 15:40:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:01,297 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 566 transitions. [2025-02-05 15:40:01,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 566 transitions. [2025-02-05 15:40:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:40:01,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:01,298 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] [2025-02-05 15:40:01,306 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:40:01,499 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:40:01,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:01,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 605538285, now seen corresponding path program 1 times [2025-02-05 15:40:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725197438] [2025-02-05 15:40:01,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:01,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:01,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:40:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:40:01,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:01,650 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:40:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725197438] [2025-02-05 15:40:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725197438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:01,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319193230] [2025-02-05 15:40:01,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:01,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:01,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:01,653 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:40:01,654 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:40:01,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:40:01,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:40:01,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:01,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:01,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:40:01,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:01,924 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:40:01,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319193230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:40:01,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729063351] [2025-02-05 15:40:01,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:01,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:01,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:01,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:01,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:01,926 INFO L87 Difference]: Start difference. First operand 371 states and 566 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:01,976 INFO L93 Difference]: Finished difference Result 731 states and 1121 transitions. [2025-02-05 15:40:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2025-02-05 15:40:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:01,978 INFO L225 Difference]: With dead ends: 731 [2025-02-05 15:40:01,979 INFO L226 Difference]: Without dead ends: 373 [2025-02-05 15:40:01,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:01,980 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 2 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1823 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:40:01,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1823 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-05 15:40:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-02-05 15:40:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 295 states have internal predecessors, (444), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-02-05 15:40:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 572 transitions. [2025-02-05 15:40:01,991 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 572 transitions. Word has length 130 [2025-02-05 15:40:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:01,991 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 572 transitions. [2025-02-05 15:40:01,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 572 transitions. [2025-02-05 15:40:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:40:01,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:01,993 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] [2025-02-05 15:40:02,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:02,198 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:40:02,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:02,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash 536118013, now seen corresponding path program 1 times [2025-02-05 15:40:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058053634] [2025-02-05 15:40:02,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:02,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:40:02,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:40:02,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:02,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:02,326 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:40:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:02,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058053634] [2025-02-05 15:40:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058053634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:02,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613814713] [2025-02-05 15:40:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:02,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:02,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:02,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:02,328 INFO L87 Difference]: Start difference. First operand 373 states and 572 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:02,359 INFO L93 Difference]: Finished difference Result 723 states and 1112 transitions. [2025-02-05 15:40:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 131 [2025-02-05 15:40:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:02,361 INFO L225 Difference]: With dead ends: 723 [2025-02-05 15:40:02,361 INFO L226 Difference]: Without dead ends: 373 [2025-02-05 15:40:02,362 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:40:02,363 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1841 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:40:02,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1841 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-05 15:40:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-02-05 15:40:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 295 states have internal predecessors, (444), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-02-05 15:40:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 571 transitions. [2025-02-05 15:40:02,374 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 571 transitions. Word has length 131 [2025-02-05 15:40:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:02,374 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 571 transitions. [2025-02-05 15:40:02,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 571 transitions. [2025-02-05 15:40:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:40:02,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:02,376 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] [2025-02-05 15:40:02,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:40:02,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:02,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1352249941, now seen corresponding path program 2 times [2025-02-05 15:40:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146555060] [2025-02-05 15:40:02,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:02,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-02-05 15:40:02,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 132 statements. [2025-02-05 15:40:02,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:40:02,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:02,479 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:40:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146555060] [2025-02-05 15:40:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146555060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:40:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216258836] [2025-02-05 15:40:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:02,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:02,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:02,481 INFO L87 Difference]: Start difference. First operand 373 states and 571 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:02,763 INFO L93 Difference]: Finished difference Result 933 states and 1416 transitions. [2025-02-05 15:40:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:40:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 132 [2025-02-05 15:40:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:02,767 INFO L225 Difference]: With dead ends: 933 [2025-02-05 15:40:02,768 INFO L226 Difference]: Without dead ends: 784 [2025-02-05 15:40:02,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:40:02,769 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 501 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:02,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2797 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:40:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-02-05 15:40:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 725. [2025-02-05 15:40:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 568 states have (on average 1.5422535211267605) internal successors, (876), 575 states have internal predecessors, (876), 116 states have call successors, (116), 38 states have call predecessors, (116), 40 states have return successors, (127), 115 states have call predecessors, (127), 114 states have call successors, (127) [2025-02-05 15:40:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1119 transitions. [2025-02-05 15:40:02,798 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1119 transitions. Word has length 132 [2025-02-05 15:40:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:02,799 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1119 transitions. [2025-02-05 15:40:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1119 transitions. [2025-02-05 15:40:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:40:02,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:02,802 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] [2025-02-05 15:40:02,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:40:02,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -706576799, now seen corresponding path program 1 times [2025-02-05 15:40:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:02,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255949305] [2025-02-05 15:40:02,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:02,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:40:02,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:40:02,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:02,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:40:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255949305] [2025-02-05 15:40:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255949305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518550240] [2025-02-05 15:40:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:02,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:02,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:02,966 INFO L87 Difference]: Start difference. First operand 725 states and 1119 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:03,010 INFO L93 Difference]: Finished difference Result 1429 states and 2211 transitions. [2025-02-05 15:40:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2025-02-05 15:40:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:03,014 INFO L225 Difference]: With dead ends: 1429 [2025-02-05 15:40:03,015 INFO L226 Difference]: Without dead ends: 727 [2025-02-05 15:40:03,017 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:40:03,017 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1844 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:40:03,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1844 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-05 15:40:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-02-05 15:40:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 569 states have (on average 1.5413005272407734) internal successors, (877), 577 states have internal predecessors, (877), 116 states have call successors, (116), 38 states have call predecessors, (116), 41 states have return successors, (129), 115 states have call predecessors, (129), 114 states have call successors, (129) [2025-02-05 15:40:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1122 transitions. [2025-02-05 15:40:03,042 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1122 transitions. Word has length 133 [2025-02-05 15:40:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:03,042 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1122 transitions. [2025-02-05 15:40:03,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:40:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1122 transitions. [2025-02-05 15:40:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:40:03,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:03,045 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] [2025-02-05 15:40:03,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:40:03,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:03,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash -72084394, now seen corresponding path program 1 times [2025-02-05 15:40:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979399906] [2025-02-05 15:40:03,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:03,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:40:03,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:40:03,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:03,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:40:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979399906] [2025-02-05 15:40:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979399906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060197469] [2025-02-05 15:40:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:03,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:03,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:03,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:03,178 INFO L87 Difference]: Start difference. First operand 727 states and 1122 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:40:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:03,284 INFO L93 Difference]: Finished difference Result 1075 states and 1658 transitions. [2025-02-05 15:40:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:40:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 134 [2025-02-05 15:40:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:03,287 INFO L225 Difference]: With dead ends: 1075 [2025-02-05 15:40:03,288 INFO L226 Difference]: Without dead ends: 377 [2025-02-05 15:40:03,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:40:03,290 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 7 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:03,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3149 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-05 15:40:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-02-05 15:40:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 293 states have (on average 1.5255972696245734) internal successors, (447), 298 states have internal predecessors, (447), 61 states have call successors, (61), 20 states have call predecessors, (61), 22 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-02-05 15:40:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 575 transitions. [2025-02-05 15:40:03,303 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 575 transitions. Word has length 134 [2025-02-05 15:40:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:03,303 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 575 transitions. [2025-02-05 15:40:03,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:40:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 575 transitions. [2025-02-05 15:40:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:40:03,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:03,305 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] [2025-02-05 15:40:03,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:40:03,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:03,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash -906284228, now seen corresponding path program 1 times [2025-02-05 15:40:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:03,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114550544] [2025-02-05 15:40:03,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:03,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:40:03,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:40:03,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:03,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:40:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114550544] [2025-02-05 15:40:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114550544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946425840] [2025-02-05 15:40:03,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:03,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:03,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:03,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:03,423 INFO L87 Difference]: Start difference. First operand 377 states and 575 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:40:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:03,527 INFO L93 Difference]: Finished difference Result 730 states and 1121 transitions. [2025-02-05 15:40:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:40:03,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 134 [2025-02-05 15:40:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:03,530 INFO L225 Difference]: With dead ends: 730 [2025-02-05 15:40:03,530 INFO L226 Difference]: Without dead ends: 380 [2025-02-05 15:40:03,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:40:03,532 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 5 mSDsluCounter, 2707 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:03,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3163 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-05 15:40:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-02-05 15:40:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 295 states have (on average 1.5220338983050847) internal successors, (449), 301 states have internal predecessors, (449), 61 states have call successors, (61), 20 states have call predecessors, (61), 23 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-02-05 15:40:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 582 transitions. [2025-02-05 15:40:03,546 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 582 transitions. Word has length 134 [2025-02-05 15:40:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 582 transitions. [2025-02-05 15:40:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:40:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 582 transitions. [2025-02-05 15:40:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:40:03,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:03,549 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] [2025-02-05 15:40:03,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:40:03,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 517317443, now seen corresponding path program 1 times [2025-02-05 15:40:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860499978] [2025-02-05 15:40:03,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:40:03,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:40:03,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:03,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:03,725 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:40:03,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:03,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860499978] [2025-02-05 15:40:03,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860499978] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:03,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243502317] [2025-02-05 15:40:03,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:03,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:03,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:03,729 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:40:03,731 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:40:03,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:40:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:40:03,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:03,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:03,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:03,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:04,028 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:40:04,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:04,113 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:40:04,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243502317] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:04,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:04,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:40:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312817634] [2025-02-05 15:40:04,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:04,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:40:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:04,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:40:04,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:04,114 INFO L87 Difference]: Start difference. First operand 380 states and 582 transitions. Second operand has 11 states, 10 states have (on average 13.5) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-05 15:40:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:04,662 INFO L93 Difference]: Finished difference Result 1102 states and 1766 transitions. [2025-02-05 15:40:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:40:04,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.5) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 135 [2025-02-05 15:40:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:04,667 INFO L225 Difference]: With dead ends: 1102 [2025-02-05 15:40:04,667 INFO L226 Difference]: Without dead ends: 754 [2025-02-05 15:40:04,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:40:04,669 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1146 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:04,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 3294 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:40:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-02-05 15:40:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 730. [2025-02-05 15:40:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 581 states have (on average 1.5783132530120483) internal successors, (917), 586 states have internal predecessors, (917), 125 states have call successors, (125), 21 states have call predecessors, (125), 23 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-02-05 15:40:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1188 transitions. [2025-02-05 15:40:04,699 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1188 transitions. Word has length 135 [2025-02-05 15:40:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:04,699 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1188 transitions. [2025-02-05 15:40:04,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.5) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-05 15:40:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1188 transitions. [2025-02-05 15:40:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:40:04,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:04,703 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] [2025-02-05 15:40:04,713 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:40:04,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:40:04,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:04,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1869205662, now seen corresponding path program 1 times [2025-02-05 15:40:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:04,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812870029] [2025-02-05 15:40:04,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:04,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:04,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:40:04,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:40:04,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:04,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:04,972 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:40:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812870029] [2025-02-05 15:40:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812870029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:04,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130853842] [2025-02-05 15:40:04,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:04,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:04,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:04,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:04,973 INFO L87 Difference]: Start difference. First operand 730 states and 1188 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:05,009 INFO L93 Difference]: Finished difference Result 1707 states and 2826 transitions. [2025-02-05 15:40:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-02-05 15:40:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:05,015 INFO L225 Difference]: With dead ends: 1707 [2025-02-05 15:40:05,015 INFO L226 Difference]: Without dead ends: 1058 [2025-02-05 15:40:05,017 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:40:05,017 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 112 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 944 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:40:05,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 944 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-02-05 15:40:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1050. [2025-02-05 15:40:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 837 states have (on average 1.5973715651135005) internal successors, (1337), 842 states have internal predecessors, (1337), 189 states have call successors, (189), 21 states have call predecessors, (189), 23 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-02-05 15:40:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1746 transitions. [2025-02-05 15:40:05,056 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1746 transitions. Word has length 138 [2025-02-05 15:40:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:05,056 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1746 transitions. [2025-02-05 15:40:05,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1746 transitions. [2025-02-05 15:40:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:40:05,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:05,061 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] [2025-02-05 15:40:05,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:40:05,061 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:05,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash 646988779, now seen corresponding path program 1 times [2025-02-05 15:40:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330593699] [2025-02-05 15:40:05,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:05,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:40:05,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:40:05,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:05,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:05,107 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:40:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330593699] [2025-02-05 15:40:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330593699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560838076] [2025-02-05 15:40:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:05,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:05,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:05,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:05,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:05,108 INFO L87 Difference]: Start difference. First operand 1050 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:05,181 INFO L93 Difference]: Finished difference Result 2501 states and 4183 transitions. [2025-02-05 15:40:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-02-05 15:40:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:05,190 INFO L225 Difference]: With dead ends: 2501 [2025-02-05 15:40:05,190 INFO L226 Difference]: Without dead ends: 1583 [2025-02-05 15:40:05,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:05,193 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 110 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 932 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:40:05,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 932 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-02-05 15:40:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1575. [2025-02-05 15:40:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1267 states have (on average 1.606156274664562) internal successors, (2035), 1272 states have internal predecessors, (2035), 284 states have call successors, (284), 21 states have call predecessors, (284), 23 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-02-05 15:40:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2634 transitions. [2025-02-05 15:40:05,257 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2634 transitions. Word has length 139 [2025-02-05 15:40:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:05,258 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2634 transitions. [2025-02-05 15:40:05,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2634 transitions. [2025-02-05 15:40:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:40:05,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:05,265 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] [2025-02-05 15:40:05,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:40:05,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:05,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1158864291, now seen corresponding path program 1 times [2025-02-05 15:40:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034137228] [2025-02-05 15:40:05,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:05,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:40:05,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:40:05,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:05,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:05,315 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:40:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034137228] [2025-02-05 15:40:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034137228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442214566] [2025-02-05 15:40:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:05,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:05,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:05,316 INFO L87 Difference]: Start difference. First operand 1575 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:05,383 INFO L93 Difference]: Finished difference Result 3690 states and 6217 transitions. [2025-02-05 15:40:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:05,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-02-05 15:40:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:05,395 INFO L225 Difference]: With dead ends: 3690 [2025-02-05 15:40:05,395 INFO L226 Difference]: Without dead ends: 2379 [2025-02-05 15:40:05,399 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:40:05,399 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 108 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 927 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:40:05,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 927 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-02-05 15:40:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2371. [2025-02-05 15:40:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1940 states have (on average 1.6128865979381444) internal successors, (3129), 1945 states have internal predecessors, (3129), 407 states have call successors, (407), 21 states have call predecessors, (407), 23 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-02-05 15:40:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3990 transitions. [2025-02-05 15:40:05,539 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3990 transitions. Word has length 140 [2025-02-05 15:40:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:05,540 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3990 transitions. [2025-02-05 15:40:05,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3990 transitions. [2025-02-05 15:40:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:40:05,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:05,551 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] [2025-02-05 15:40:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:40:05,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1513996298, now seen corresponding path program 1 times [2025-02-05 15:40:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711075952] [2025-02-05 15:40:05,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:05,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:40:05,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:40:05,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:05,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:05,611 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:40:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:05,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711075952] [2025-02-05 15:40:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711075952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:05,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447665488] [2025-02-05 15:40:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:05,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:05,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:05,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:05,613 INFO L87 Difference]: Start difference. First operand 2371 states and 3990 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:05,746 INFO L93 Difference]: Finished difference Result 5543 states and 9389 transitions. [2025-02-05 15:40:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 141 [2025-02-05 15:40:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:05,769 INFO L225 Difference]: With dead ends: 5543 [2025-02-05 15:40:05,769 INFO L226 Difference]: Without dead ends: 3651 [2025-02-05 15:40:05,777 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:40:05,777 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 106 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 927 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:40:05,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 927 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2025-02-05 15:40:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3643. [2025-02-05 15:40:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 3033 states have (on average 1.6172106824925816) internal successors, (4905), 3038 states have internal predecessors, (4905), 586 states have call successors, (586), 21 states have call predecessors, (586), 23 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-02-05 15:40:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 6150 transitions. [2025-02-05 15:40:06,007 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 6150 transitions. Word has length 141 [2025-02-05 15:40:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:06,007 INFO L471 AbstractCegarLoop]: Abstraction has 3643 states and 6150 transitions. [2025-02-05 15:40:06,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 6150 transitions. [2025-02-05 15:40:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:40:06,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:06,023 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] [2025-02-05 15:40:06,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:40:06,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:06,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash 702465732, now seen corresponding path program 1 times [2025-02-05 15:40:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:06,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780667216] [2025-02-05 15:40:06,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:06,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:40:06,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:40:06,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:06,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:06,069 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:40:06,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:06,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780667216] [2025-02-05 15:40:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780667216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:06,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:06,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019977018] [2025-02-05 15:40:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:06,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:06,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:06,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:06,073 INFO L87 Difference]: Start difference. First operand 3643 states and 6150 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:06,196 INFO L93 Difference]: Finished difference Result 8590 states and 14597 transitions. [2025-02-05 15:40:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 142 [2025-02-05 15:40:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:06,222 INFO L225 Difference]: With dead ends: 8590 [2025-02-05 15:40:06,222 INFO L226 Difference]: Without dead ends: 5753 [2025-02-05 15:40:06,231 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:40:06,232 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 104 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 938 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:40:06,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 938 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2025-02-05 15:40:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 5745. [2025-02-05 15:40:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5745 states, 4759 states have (on average 1.6121033830636688) internal successors, (7672), 4764 states have internal predecessors, (7672), 962 states have call successors, (962), 21 states have call predecessors, (962), 23 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-02-05 15:40:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 9713 transitions. [2025-02-05 15:40:06,526 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 9713 transitions. Word has length 142 [2025-02-05 15:40:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:06,527 INFO L471 AbstractCegarLoop]: Abstraction has 5745 states and 9713 transitions. [2025-02-05 15:40:06,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 9713 transitions. [2025-02-05 15:40:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:40:06,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:06,547 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] [2025-02-05 15:40:06,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:40:06,547 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:06,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1108785623, now seen corresponding path program 1 times [2025-02-05 15:40:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:06,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113748138] [2025-02-05 15:40:06,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:06,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:40:06,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:40:06,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:06,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:06,628 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:40:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113748138] [2025-02-05 15:40:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113748138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441892979] [2025-02-05 15:40:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:06,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:06,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:06,629 INFO L87 Difference]: Start difference. First operand 5745 states and 9713 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:06,840 INFO L93 Difference]: Finished difference Result 14102 states and 23994 transitions. [2025-02-05 15:40:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:06,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 143 [2025-02-05 15:40:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:06,885 INFO L225 Difference]: With dead ends: 14102 [2025-02-05 15:40:06,885 INFO L226 Difference]: Without dead ends: 9559 [2025-02-05 15:40:06,900 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:40:06,901 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 102 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 934 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:40:06,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9559 states. [2025-02-05 15:40:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9559 to 9551. [2025-02-05 15:40:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9551 states, 7959 states have (on average 1.6106294760648323) internal successors, (12819), 7964 states have internal predecessors, (12819), 1568 states have call successors, (1568), 21 states have call predecessors, (1568), 23 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-02-05 15:40:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 16150 transitions. [2025-02-05 15:40:07,632 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 16150 transitions. Word has length 143 [2025-02-05 15:40:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:07,632 INFO L471 AbstractCegarLoop]: Abstraction has 9551 states and 16150 transitions. [2025-02-05 15:40:07,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 16150 transitions. [2025-02-05 15:40:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:40:07,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:07,667 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] [2025-02-05 15:40:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:40:07,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1813498309, now seen corresponding path program 1 times [2025-02-05 15:40:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135090045] [2025-02-05 15:40:07,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:07,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:40:07,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:40:07,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:07,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:07,741 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:40:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135090045] [2025-02-05 15:40:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135090045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:07,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096208850] [2025-02-05 15:40:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:07,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:07,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:07,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:07,743 INFO L87 Difference]: Start difference. First operand 9551 states and 16150 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:08,202 INFO L93 Difference]: Finished difference Result 24609 states and 41792 transitions. [2025-02-05 15:40:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2025-02-05 15:40:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:08,267 INFO L225 Difference]: With dead ends: 24609 [2025-02-05 15:40:08,268 INFO L226 Difference]: Without dead ends: 16735 [2025-02-05 15:40:08,298 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:40:08,299 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 100 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 952 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:40:08,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 952 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16735 states. [2025-02-05 15:40:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16735 to 16727. [2025-02-05 15:40:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16727 states, 13932 states have (on average 1.6026414010910135) internal successors, (22328), 13937 states have internal predecessors, (22328), 2771 states have call successors, (2771), 21 states have call predecessors, (2771), 23 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-02-05 15:40:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16727 states to 16727 states and 28209 transitions. [2025-02-05 15:40:08,975 INFO L78 Accepts]: Start accepts. Automaton has 16727 states and 28209 transitions. Word has length 144 [2025-02-05 15:40:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:08,975 INFO L471 AbstractCegarLoop]: Abstraction has 16727 states and 28209 transitions. [2025-02-05 15:40:08,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16727 states and 28209 transitions. [2025-02-05 15:40:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:40:09,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:09,015 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:40:09,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:40:09,015 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:09,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1808048952, now seen corresponding path program 1 times [2025-02-05 15:40:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:09,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012079222] [2025-02-05 15:40:09,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:09,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:40:09,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:40:09,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:09,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:09,064 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:40:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012079222] [2025-02-05 15:40:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012079222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832099417] [2025-02-05 15:40:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:09,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:09,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:09,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:09,066 INFO L87 Difference]: Start difference. First operand 16727 states and 28209 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:09,676 INFO L93 Difference]: Finished difference Result 44190 states and 74870 transitions. [2025-02-05 15:40:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:09,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 145 [2025-02-05 15:40:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:09,793 INFO L225 Difference]: With dead ends: 44190 [2025-02-05 15:40:09,793 INFO L226 Difference]: Without dead ends: 29809 [2025-02-05 15:40:09,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:09,838 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 98 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 930 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:40:09,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29809 states. [2025-02-05 15:40:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29809 to 29801. [2025-02-05 15:40:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29801 states, 24967 states have (on average 1.5991108262907037) internal successors, (39925), 24972 states have internal predecessors, (39925), 4810 states have call successors, (4810), 21 states have call predecessors, (4810), 23 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-02-05 15:40:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29801 states to 29801 states and 50158 transitions. [2025-02-05 15:40:11,387 INFO L78 Accepts]: Start accepts. Automaton has 29801 states and 50158 transitions. Word has length 145 [2025-02-05 15:40:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:11,392 INFO L471 AbstractCegarLoop]: Abstraction has 29801 states and 50158 transitions. [2025-02-05 15:40:11,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 29801 states and 50158 transitions. [2025-02-05 15:40:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:40:11,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:11,455 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:40:11,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:40:11,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:11,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1352521306, now seen corresponding path program 1 times [2025-02-05 15:40:11,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:11,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061668651] [2025-02-05 15:40:11,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:11,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:40:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:40:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:11,507 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:40:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061668651] [2025-02-05 15:40:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061668651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628965071] [2025-02-05 15:40:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:11,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:11,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:11,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:11,510 INFO L87 Difference]: Start difference. First operand 29801 states and 50158 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:12,419 INFO L93 Difference]: Finished difference Result 81147 states and 137082 transitions. [2025-02-05 15:40:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:12,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 146 [2025-02-05 15:40:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:12,585 INFO L225 Difference]: With dead ends: 81147 [2025-02-05 15:40:12,586 INFO L226 Difference]: Without dead ends: 54495 [2025-02-05 15:40:12,636 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:40:12,638 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 96 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 935 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:40:12,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54495 states. [2025-02-05 15:40:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54495 to 54487. [2025-02-05 15:40:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54487 states, 45938 states have (on average 1.594170403587444) internal successors, (73233), 45943 states have internal predecessors, (73233), 8525 states have call successors, (8525), 21 states have call predecessors, (8525), 23 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-02-05 15:40:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54487 states to 54487 states and 91428 transitions. [2025-02-05 15:40:14,600 INFO L78 Accepts]: Start accepts. Automaton has 54487 states and 91428 transitions. Word has length 146 [2025-02-05 15:40:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:14,600 INFO L471 AbstractCegarLoop]: Abstraction has 54487 states and 91428 transitions. [2025-02-05 15:40:14,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 54487 states and 91428 transitions. [2025-02-05 15:40:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:40:14,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:14,648 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:40:14,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:40:14,648 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:14,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 851811015, now seen corresponding path program 1 times [2025-02-05 15:40:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616990625] [2025-02-05 15:40:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:14,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:40:14,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:40:14,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:14,976 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:40:14,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:14,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616990625] [2025-02-05 15:40:14,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616990625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:14,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:14,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641565629] [2025-02-05 15:40:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:14,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:14,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:14,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:14,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:14,978 INFO L87 Difference]: Start difference. First operand 54487 states and 91428 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:16,917 INFO L93 Difference]: Finished difference Result 101693 states and 170989 transitions. [2025-02-05 15:40:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:16,918 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2025-02-05 15:40:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:17,473 INFO L225 Difference]: With dead ends: 101693 [2025-02-05 15:40:17,473 INFO L226 Difference]: Without dead ends: 101536 [2025-02-05 15:40:17,509 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:40:17,510 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 91 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 936 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:40:17,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 936 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101536 states. [2025-02-05 15:40:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101536 to 101528. [2025-02-05 15:40:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101528 states, 86180 states have (on average 1.5877349733116732) internal successors, (136831), 86185 states have internal predecessors, (136831), 15324 states have call successors, (15324), 21 states have call predecessors, (15324), 23 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-02-05 15:40:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101528 states to 101528 states and 169670 transitions. [2025-02-05 15:40:20,693 INFO L78 Accepts]: Start accepts. Automaton has 101528 states and 169670 transitions. Word has length 147 [2025-02-05 15:40:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:20,694 INFO L471 AbstractCegarLoop]: Abstraction has 101528 states and 169670 transitions. [2025-02-05 15:40:20,694 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:40:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 101528 states and 169670 transitions. [2025-02-05 15:40:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:40:20,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:20,769 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:40:20,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:40:20,769 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:20,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1010571719, now seen corresponding path program 1 times [2025-02-05 15:40:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:20,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201942213] [2025-02-05 15:40:20,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:20,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:40:20,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:40:20,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:20,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:40:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201942213] [2025-02-05 15:40:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201942213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894115476] [2025-02-05 15:40:21,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:21,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:21,404 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:40:21,413 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:40:21,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:40:21,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:40:21,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:21,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:21,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:40:21,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:40:22,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:22,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894115476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:22,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:22,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-02-05 15:40:22,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044388612] [2025-02-05 15:40:22,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:22,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:40:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:22,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:40:22,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:40:22,224 INFO L87 Difference]: Start difference. First operand 101528 states and 169670 transitions. Second operand has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 9 states have internal predecessors, (112), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-05 15:40:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:27,250 INFO L93 Difference]: Finished difference Result 202328 states and 343620 transitions. [2025-02-05 15:40:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:40:27,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 9 states have internal predecessors, (112), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 148 [2025-02-05 15:40:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:28,434 INFO L225 Difference]: With dead ends: 202328 [2025-02-05 15:40:28,434 INFO L226 Difference]: Without dead ends: 202179 [2025-02-05 15:40:28,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:40:28,585 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1059 mSDsluCounter, 3947 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:28,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 4547 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 15:40:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202179 states.