./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e61661fc2d58041f16237a6d2ff2f3d5f72c7660b85c9fdf3f096a51b709ec23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:25:06,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:25:06,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:25:06,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:25:06,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:25:07,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:25:07,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:25:07,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:25:07,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:25:07,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:25:07,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:25:07,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:25:07,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:25:07,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:25:07,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:25:07,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:25:07,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:25:07,007 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/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 -> e61661fc2d58041f16237a6d2ff2f3d5f72c7660b85c9fdf3f096a51b709ec23 [2025-03-03 14:25:07,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:25:07,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:25:07,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:25:07,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:25:07,238 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:25:07,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c [2025-03-03 14:25:08,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32de9ccae/3c61d176fba04e70882fd78b961ad2f0/FLAGde18d9c17 [2025-03-03 14:25:08,802 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:25:08,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c [2025-03-03 14:25:08,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32de9ccae/3c61d176fba04e70882fd78b961ad2f0/FLAGde18d9c17 [2025-03-03 14:25:08,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32de9ccae/3c61d176fba04e70882fd78b961ad2f0 [2025-03-03 14:25:08,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:25:08,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:25:08,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:25:08,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:25:08,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:25:08,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:25:08" (1/1) ... [2025-03-03 14:25:08,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac7c03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:08, skipping insertion in model container [2025-03-03 14:25:08,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:25:08" (1/1) ... [2025-03-03 14:25:08,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:25:09,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c[21483,21496] [2025-03-03 14:25:09,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:25:09,292 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:25:09,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-03 14:25:09,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-03-03 14:25:09,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [509] [2025-03-03 14:25:09,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [875] [2025-03-03 14:25:09,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [893] [2025-03-03 14:25:09,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [943] [2025-03-03 14:25:09,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [952] [2025-03-03 14:25:09,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2031] [2025-03-03 14:25:09,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2260] [2025-03-03 14:25:09,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2551] [2025-03-03 14:25:09,301 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2850] [2025-03-03 14:25:09,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c[21483,21496] [2025-03-03 14:25:09,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:25:09,401 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:25:09,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09 WrapperNode [2025-03-03 14:25:09,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:25:09,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:25:09,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:25:09,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:25:09,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,447 INFO L138 Inliner]: procedures = 129, calls = 195, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1009 [2025-03-03 14:25:09,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:25:09,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:25:09,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:25:09,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:25:09,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,483 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-03-03 14:25:09,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:25:09,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:25:09,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:25:09,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:25:09,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (1/1) ... [2025-03-03 14:25:09,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:25:09,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:09,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:25:09,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:25:09,562 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:25:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:25:09,563 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:25:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:25:09,563 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:25:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:25:09,563 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:25:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:25:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:25:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:25:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:25:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:25:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:25:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:25:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:25:09,565 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:25:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:25:09,566 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:25:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:25:09,566 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:25:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:25:09,567 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:25:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:25:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:25:09,567 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:25:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:25:09,568 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:25:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:25:09,568 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:25:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:25:09,568 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:25:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:25:09,568 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:25:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:25:09,568 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:25:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:25:09,569 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:25:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:25:09,570 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:25:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:25:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:25:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:25:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:25:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:25:09,570 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:25:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:25:09,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:25:09,726 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:25:09,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:25:09,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926-1: isReadable_#res#1 := isReadable_~retValue_acc~41#1; [2025-03-03 14:25:09,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1961-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2025-03-03 14:25:09,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-03 14:25:09,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1889-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~31#1; [2025-03-03 14:25:09,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~25#1; [2025-03-03 14:25:09,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2025-03-03 14:25:09,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-03-03 14:25:10,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810: #res := ~retValue_acc~39; [2025-03-03 14:25:10,038 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: #res#1 := ~retValue_acc~28#1; [2025-03-03 14:25:10,038 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1620-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2025-03-03 14:25:10,047 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1573: #res := ~retValue_acc~26; [2025-03-03 14:25:10,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-03-03 14:25:10,064 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-03 14:25:10,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-03 14:25:10,097 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-03 14:25:10,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2785-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~38#1; [2025-03-03 14:25:10,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1728-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2025-03-03 14:25:10,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-03 14:25:10,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2767-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~36#1; [2025-03-03 14:25:10,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~37#1; [2025-03-03 14:25:10,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1835-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2025-03-03 14:25:10,361 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-03 14:25:10,467 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-03-03 14:25:10,467 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:25:10,482 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:25:10,482 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:25:10,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:25:10 BoogieIcfgContainer [2025-03-03 14:25:10,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:25:10,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:25:10,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:25:10,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:25:10,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:25:08" (1/3) ... [2025-03-03 14:25:10,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5d2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:25:10, skipping insertion in model container [2025-03-03 14:25:10,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:09" (2/3) ... [2025-03-03 14:25:10,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5d2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:25:10, skipping insertion in model container [2025-03-03 14:25:10,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:25:10" (3/3) ... [2025-03-03 14:25:10,489 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product22.cil.c [2025-03-03 14:25:10,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:25:10,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product22.cil.c that has 21 procedures, 333 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:25:10,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:25:10,565 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;@5cf07ad8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:25:10,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:25:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 257 states have (on average 1.5136186770428015) internal successors, (389), 261 states have internal predecessors, (389), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 14:25:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:25:10,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:10,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:10,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:10,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1628364117, now seen corresponding path program 1 times [2025-03-03 14:25:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558330967] [2025-03-03 14:25:10,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:10,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:25:10,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:25:10,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:25:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:11,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558330967] [2025-03-03 14:25:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558330967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:11,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412859766] [2025-03-03 14:25:11,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:11,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:11,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:25:11,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:25:11,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:25:11,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:11,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:11,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:25:11,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:25:11,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412859766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:11,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:11,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:25:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368893126] [2025-03-03 14:25:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:11,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:25:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:25:11,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:11,521 INFO L87 Difference]: Start difference. First operand has 333 states, 257 states have (on average 1.5136186770428015) internal successors, (389), 261 states have internal predecessors, (389), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:11,563 INFO L93 Difference]: Finished difference Result 508 states and 742 transitions. [2025-03-03 14:25:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:25:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2025-03-03 14:25:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:11,577 INFO L225 Difference]: With dead ends: 508 [2025-03-03 14:25:11,577 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 14:25:11,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 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-03-03 14:25:11,583 INFO L435 NwaCegarLoop]: 494 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, 494 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-03-03 14:25:11,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 14:25:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-03 14:25:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 254 states have internal predecessors, (379), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:25:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2025-03-03 14:25:11,649 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 114 [2025-03-03 14:25:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:11,651 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2025-03-03 14:25:11,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2025-03-03 14:25:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:25:11,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:11,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:11,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:25:11,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:25:11,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2064450067, now seen corresponding path program 1 times [2025-03-03 14:25:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866180735] [2025-03-03 14:25:11,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:11,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:25:11,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:25:11,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:25:12,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:12,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866180735] [2025-03-03 14:25:12,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866180735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:12,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411129499] [2025-03-03 14:25:12,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:12,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:12,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:25:12,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:25:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:25:12,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:12,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:25:12,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:25:12,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411129499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:25:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010590891] [2025-03-03 14:25:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:12,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:12,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:12,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:25:12,455 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:12,493 INFO L93 Difference]: Finished difference Result 497 states and 723 transitions. [2025-03-03 14:25:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:12,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2025-03-03 14:25:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:12,497 INFO L225 Difference]: With dead ends: 497 [2025-03-03 14:25:12,497 INFO L226 Difference]: Without dead ends: 328 [2025-03-03 14:25:12,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 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-03-03 14:25:12,502 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 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-03-03 14:25:12,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-03 14:25:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-03 14:25:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 253 states have (on average 1.5059288537549407) internal successors, (381), 256 states have internal predecessors, (381), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:25:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 488 transitions. [2025-03-03 14:25:12,535 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 488 transitions. Word has length 115 [2025-03-03 14:25:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:12,535 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 488 transitions. [2025-03-03 14:25:12,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 488 transitions. [2025-03-03 14:25:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:25:12,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:12,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:12,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:25:12,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:25:12,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 952459063, now seen corresponding path program 1 times [2025-03-03 14:25:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:12,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807993955] [2025-03-03 14:25:12,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:12,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:12,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:25:12,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:25:12,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:12,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:25:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807993955] [2025-03-03 14:25:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807993955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690580964] [2025-03-03 14:25:12,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:12,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:12,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:12,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:12,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:25:13,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:25:13,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:25:13,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:13,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:13,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:25:13,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:25:13,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690580964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:25:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508153752] [2025-03-03 14:25:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:13,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:25:13,263 INFO L87 Difference]: Start difference. First operand 328 states and 488 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:13,304 INFO L93 Difference]: Finished difference Result 690 states and 1042 transitions. [2025-03-03 14:25:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-03-03 14:25:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:13,310 INFO L225 Difference]: With dead ends: 690 [2025-03-03 14:25:13,311 INFO L226 Difference]: Without dead ends: 389 [2025-03-03 14:25:13,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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-03-03 14:25:13,314 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 115 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 933 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-03-03 14:25:13,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 933 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-03 14:25:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2025-03-03 14:25:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 295 states have (on average 1.5254237288135593) internal successors, (450), 298 states have internal predecessors, (450), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 14:25:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 579 transitions. [2025-03-03 14:25:13,345 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 579 transitions. Word has length 123 [2025-03-03 14:25:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:13,348 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 579 transitions. [2025-03-03 14:25:13,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 579 transitions. [2025-03-03 14:25:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:25:13,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:13,351 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:13,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:25:13,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:13,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1367718857, now seen corresponding path program 1 times [2025-03-03 14:25:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630846034] [2025-03-03 14:25:13,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:13,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:25:13,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:25:13,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:13,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:25:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630846034] [2025-03-03 14:25:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630846034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487754677] [2025-03-03 14:25:13,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:13,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:13,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:13,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:13,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:25:13,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:25:13,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:25:13,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:13,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:13,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:25:13,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:25:14,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487754677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:25:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089166197] [2025-03-03 14:25:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:14,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:14,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:25:14,007 INFO L87 Difference]: Start difference. First operand 381 states and 579 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:14,057 INFO L93 Difference]: Finished difference Result 753 states and 1148 transitions. [2025-03-03 14:25:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:14,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-03-03 14:25:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:14,061 INFO L225 Difference]: With dead ends: 753 [2025-03-03 14:25:14,061 INFO L226 Difference]: Without dead ends: 383 [2025-03-03 14:25:14,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 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-03-03 14:25:14,062 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1901 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-03-03 14:25:14,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1901 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-03 14:25:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-03-03 14:25:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 296 states have (on average 1.5236486486486487) internal successors, (451), 300 states have internal predecessors, (451), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (66), 64 states have call predecessors, (66), 64 states have call successors, (66) [2025-03-03 14:25:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 582 transitions. [2025-03-03 14:25:14,079 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 582 transitions. Word has length 124 [2025-03-03 14:25:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:14,079 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 582 transitions. [2025-03-03 14:25:14,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 582 transitions. [2025-03-03 14:25:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:25:14,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:14,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-03-03 14:25:14,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:25:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:14,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2011127644, now seen corresponding path program 1 times [2025-03-03 14:25:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350234417] [2025-03-03 14:25:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:14,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:25:14,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:25:14,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:14,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:25:14,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:14,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350234417] [2025-03-03 14:25:14,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350234417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:14,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532471744] [2025-03-03 14:25:14,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:14,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:14,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:14,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:25:14,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:25:14,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:25:14,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:14,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:14,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:25:14,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:25:14,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:14,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532471744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:14,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:14,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:25:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859833020] [2025-03-03 14:25:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:14,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:14,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:14,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:14,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:25:14,693 INFO L87 Difference]: Start difference. First operand 383 states and 582 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:14,748 INFO L93 Difference]: Finished difference Result 755 states and 1153 transitions. [2025-03-03 14:25:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:14,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-03 14:25:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:14,753 INFO L225 Difference]: With dead ends: 755 [2025-03-03 14:25:14,754 INFO L226 Difference]: Without dead ends: 385 [2025-03-03 14:25:14,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 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-03-03 14:25:14,755 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 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-03-03 14:25:14,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-03 14:25:14,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-03 14:25:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 297 states have (on average 1.5218855218855218) internal successors, (452), 302 states have internal predecessors, (452), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (71), 64 states have call predecessors, (71), 64 states have call successors, (71) [2025-03-03 14:25:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 588 transitions. [2025-03-03 14:25:14,769 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 588 transitions. Word has length 125 [2025-03-03 14:25:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:14,769 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 588 transitions. [2025-03-03 14:25:14,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 588 transitions. [2025-03-03 14:25:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:25:14,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:14,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:14,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:25:14,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:14,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:14,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:14,973 INFO L85 PathProgramCache]: Analyzing trace with hash 277575530, now seen corresponding path program 1 times [2025-03-03 14:25:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:14,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060227909] [2025-03-03 14:25:14,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:14,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:25:14,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:25:14,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:14,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:25:15,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:15,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060227909] [2025-03-03 14:25:15,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060227909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:15,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:15,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:25:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908250191] [2025-03-03 14:25:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:15,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:15,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:15,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:15,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:15,094 INFO L87 Difference]: Start difference. First operand 385 states and 588 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:15,128 INFO L93 Difference]: Finished difference Result 747 states and 1144 transitions. [2025-03-03 14:25:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:15,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-03-03 14:25:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:15,131 INFO L225 Difference]: With dead ends: 747 [2025-03-03 14:25:15,131 INFO L226 Difference]: Without dead ends: 385 [2025-03-03 14:25:15,132 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-03-03 14:25:15,133 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 2 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1905 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-03-03 14:25:15,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1905 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-03 14:25:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-03 14:25:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 297 states have (on average 1.5218855218855218) internal successors, (452), 302 states have internal predecessors, (452), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (70), 64 states have call predecessors, (70), 64 states have call successors, (70) [2025-03-03 14:25:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 587 transitions. [2025-03-03 14:25:15,155 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 587 transitions. Word has length 126 [2025-03-03 14:25:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 587 transitions. [2025-03-03 14:25:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 587 transitions. [2025-03-03 14:25:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:25:15,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:15,159 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:15,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:25:15,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:15,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1120962331, now seen corresponding path program 2 times [2025-03-03 14:25:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817398586] [2025-03-03 14:25:15,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:25:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:15,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes. [2025-03-03 14:25:15,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:25:15,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:25:15,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:25:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817398586] [2025-03-03 14:25:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817398586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:25:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782118082] [2025-03-03 14:25:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:15,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:15,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:15,294 INFO L87 Difference]: Start difference. First operand 385 states and 587 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:15,336 INFO L93 Difference]: Finished difference Result 745 states and 1139 transitions. [2025-03-03 14:25:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:15,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-03-03 14:25:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:15,339 INFO L225 Difference]: With dead ends: 745 [2025-03-03 14:25:15,339 INFO L226 Difference]: Without dead ends: 385 [2025-03-03 14:25:15,340 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-03-03 14:25:15,340 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:15,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1891 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-03 14:25:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-03 14:25:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 297 states have (on average 1.5218855218855218) internal successors, (452), 302 states have internal predecessors, (452), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (69), 64 states have call predecessors, (69), 64 states have call successors, (69) [2025-03-03 14:25:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 586 transitions. [2025-03-03 14:25:15,353 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 586 transitions. Word has length 127 [2025-03-03 14:25:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:15,354 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 586 transitions. [2025-03-03 14:25:15,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 586 transitions. [2025-03-03 14:25:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:25:15,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:15,356 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] [2025-03-03 14:25:15,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:25:15,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:15,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1733698425, now seen corresponding path program 3 times [2025-03-03 14:25:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411641438] [2025-03-03 14:25:15,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:25:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:15,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 3 equivalence classes. [2025-03-03 14:25:15,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 116 of 128 statements. [2025-03-03 14:25:15,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:25:15,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:25:15,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411641438] [2025-03-03 14:25:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411641438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:25:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198652387] [2025-03-03 14:25:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:15,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:15,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:15,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:15,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:15,456 INFO L87 Difference]: Start difference. First operand 385 states and 586 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:15,501 INFO L93 Difference]: Finished difference Result 747 states and 1145 transitions. [2025-03-03 14:25:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:15,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2025-03-03 14:25:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:15,504 INFO L225 Difference]: With dead ends: 747 [2025-03-03 14:25:15,504 INFO L226 Difference]: Without dead ends: 387 [2025-03-03 14:25:15,505 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-03-03 14:25:15,506 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1902 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-03-03 14:25:15,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1902 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-03 14:25:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-03-03 14:25:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 304 states have internal predecessors, (453), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 64 states have call predecessors, (74), 64 states have call successors, (74) [2025-03-03 14:25:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2025-03-03 14:25:15,519 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 128 [2025-03-03 14:25:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:15,519 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2025-03-03 14:25:15,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2025-03-03 14:25:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:25:15,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:15,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:15,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:25:15,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:15,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:15,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1720603832, now seen corresponding path program 1 times [2025-03-03 14:25:15,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:15,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602195607] [2025-03-03 14:25:15,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:15,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:15,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:25:15,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:25:15,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:15,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:25:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602195607] [2025-03-03 14:25:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602195607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:15,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:15,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:25:15,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59934179] [2025-03-03 14:25:15,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:15,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:15,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:15,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:15,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:15,630 INFO L87 Difference]: Start difference. First operand 387 states and 592 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:15,663 INFO L93 Difference]: Finished difference Result 753 states and 1155 transitions. [2025-03-03 14:25:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2025-03-03 14:25:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:15,666 INFO L225 Difference]: With dead ends: 753 [2025-03-03 14:25:15,666 INFO L226 Difference]: Without dead ends: 389 [2025-03-03 14:25:15,667 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-03-03 14:25:15,667 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1908 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-03-03 14:25:15,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1908 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-03 14:25:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-03-03 14:25:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 299 states have (on average 1.5183946488294315) internal successors, (454), 306 states have internal predecessors, (454), 65 states have call successors, (65), 20 states have call predecessors, (65), 24 states have return successors, (76), 64 states have call predecessors, (76), 64 states have call successors, (76) [2025-03-03 14:25:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 595 transitions. [2025-03-03 14:25:15,679 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 595 transitions. Word has length 129 [2025-03-03 14:25:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:15,680 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 595 transitions. [2025-03-03 14:25:15,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:25:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 595 transitions. [2025-03-03 14:25:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:25:15,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:15,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:25:15,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:15,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash -662761852, now seen corresponding path program 1 times [2025-03-03 14:25:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:15,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806641065] [2025-03-03 14:25:15,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:15,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:25:15,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:25:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:25:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806641065] [2025-03-03 14:25:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806641065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574761863] [2025-03-03 14:25:15,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:15,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:15,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:25:15,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:25:16,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:25:16,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:16,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:16,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:25:16,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:16,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:25:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:16,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574761863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:25:16,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:25:16,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:25:16,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517685294] [2025-03-03 14:25:16,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:25:16,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:25:16,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:16,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:25:16,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:25:16,172 INFO L87 Difference]: Start difference. First operand 389 states and 595 transitions. Second operand has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:25:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:16,650 INFO L93 Difference]: Finished difference Result 1123 states and 1795 transitions. [2025-03-03 14:25:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:25:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 130 [2025-03-03 14:25:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:16,656 INFO L225 Difference]: With dead ends: 1123 [2025-03-03 14:25:16,656 INFO L226 Difference]: Without dead ends: 763 [2025-03-03 14:25:16,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 257 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-03-03 14:25:16,658 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1382 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:16,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 3018 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:25:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-03 14:25:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 739. [2025-03-03 14:25:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 585 states have (on average 1.576068376068376) internal successors, (922), 591 states have internal predecessors, (922), 129 states have call successors, (129), 21 states have call predecessors, (129), 24 states have return successors, (150), 128 states have call predecessors, (150), 128 states have call successors, (150) [2025-03-03 14:25:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1201 transitions. [2025-03-03 14:25:16,726 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1201 transitions. Word has length 130 [2025-03-03 14:25:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1201 transitions. [2025-03-03 14:25:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:25:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1201 transitions. [2025-03-03 14:25:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:25:16,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:16,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:16,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:25:16,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:16,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:16,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1900574323, now seen corresponding path program 1 times [2025-03-03 14:25:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:16,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269530519] [2025-03-03 14:25:16,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:16,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:16,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:25:16,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:25:16,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:16,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:16,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269530519] [2025-03-03 14:25:16,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269530519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:16,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:16,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203391127] [2025-03-03 14:25:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:16,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:16,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:17,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:17,000 INFO L87 Difference]: Start difference. First operand 739 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:17,052 INFO L93 Difference]: Finished difference Result 1728 states and 2855 transitions. [2025-03-03 14:25:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:17,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-03 14:25:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:17,059 INFO L225 Difference]: With dead ends: 1728 [2025-03-03 14:25:17,059 INFO L226 Difference]: Without dead ends: 1067 [2025-03-03 14:25:17,062 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-03-03 14:25:17,062 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 112 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 966 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-03-03 14:25:17,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 966 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-03-03 14:25:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1059. [2025-03-03 14:25:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 841 states have (on average 1.595719381688466) internal successors, (1342), 847 states have internal predecessors, (1342), 193 states have call successors, (193), 21 states have call predecessors, (193), 24 states have return successors, (224), 192 states have call predecessors, (224), 192 states have call successors, (224) [2025-03-03 14:25:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1759 transitions. [2025-03-03 14:25:17,113 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1759 transitions. Word has length 133 [2025-03-03 14:25:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:17,114 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1759 transitions. [2025-03-03 14:25:17,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1759 transitions. [2025-03-03 14:25:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:25:17,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:17,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:25:17,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:17,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 87588956, now seen corresponding path program 1 times [2025-03-03 14:25:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:17,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287321493] [2025-03-03 14:25:17,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:17,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:25:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:25:17,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:17,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287321493] [2025-03-03 14:25:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287321493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:17,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:17,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843143053] [2025-03-03 14:25:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:17,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:17,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:17,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:17,175 INFO L87 Difference]: Start difference. First operand 1059 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:17,220 INFO L93 Difference]: Finished difference Result 2522 states and 4212 transitions. [2025-03-03 14:25:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-03 14:25:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:17,229 INFO L225 Difference]: With dead ends: 2522 [2025-03-03 14:25:17,229 INFO L226 Difference]: Without dead ends: 1592 [2025-03-03 14:25:17,232 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-03-03 14:25:17,233 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 110 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 962 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-03-03 14:25:17,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-03-03 14:25:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1584. [2025-03-03 14:25:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1271 states have (on average 1.6050354051927616) internal successors, (2040), 1277 states have internal predecessors, (2040), 288 states have call successors, (288), 21 states have call predecessors, (288), 24 states have return successors, (319), 287 states have call predecessors, (319), 287 states have call successors, (319) [2025-03-03 14:25:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2647 transitions. [2025-03-03 14:25:17,299 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2647 transitions. Word has length 134 [2025-03-03 14:25:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:17,299 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2647 transitions. [2025-03-03 14:25:17,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2647 transitions. [2025-03-03 14:25:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:25:17,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:17,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:17,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:25:17,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:17,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1396169262, now seen corresponding path program 1 times [2025-03-03 14:25:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:17,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733777869] [2025-03-03 14:25:17,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:17,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:25:17,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:25:17,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:17,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733777869] [2025-03-03 14:25:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733777869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:17,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:17,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:17,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917292562] [2025-03-03 14:25:17,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:17,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:17,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:17,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:17,356 INFO L87 Difference]: Start difference. First operand 1584 states and 2647 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:17,448 INFO L93 Difference]: Finished difference Result 3711 states and 6246 transitions. [2025-03-03 14:25:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:17,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-03 14:25:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:17,460 INFO L225 Difference]: With dead ends: 3711 [2025-03-03 14:25:17,460 INFO L226 Difference]: Without dead ends: 2388 [2025-03-03 14:25:17,464 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-03-03 14:25:17,465 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 108 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 959 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-03-03 14:25:17,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2025-03-03 14:25:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2380. [2025-03-03 14:25:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1944 states have (on average 1.6121399176954732) internal successors, (3134), 1950 states have internal predecessors, (3134), 411 states have call successors, (411), 21 states have call predecessors, (411), 24 states have return successors, (458), 410 states have call predecessors, (458), 410 states have call successors, (458) [2025-03-03 14:25:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 4003 transitions. [2025-03-03 14:25:17,571 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 4003 transitions. Word has length 135 [2025-03-03 14:25:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:17,574 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 4003 transitions. [2025-03-03 14:25:17,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 4003 transitions. [2025-03-03 14:25:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:25:17,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:17,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:17,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:25:17,586 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:17,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash 771093149, now seen corresponding path program 1 times [2025-03-03 14:25:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:17,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238360873] [2025-03-03 14:25:17,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:17,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:17,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:25:17,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:25:17,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:17,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238360873] [2025-03-03 14:25:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238360873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813257550] [2025-03-03 14:25:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:17,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:17,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:17,643 INFO L87 Difference]: Start difference. First operand 2380 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:17,736 INFO L93 Difference]: Finished difference Result 5564 states and 9418 transitions. [2025-03-03 14:25:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-03 14:25:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:17,757 INFO L225 Difference]: With dead ends: 5564 [2025-03-03 14:25:17,758 INFO L226 Difference]: Without dead ends: 3660 [2025-03-03 14:25:17,766 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-03-03 14:25:17,766 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 106 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 959 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-03-03 14:25:17,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2025-03-03 14:25:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3652. [2025-03-03 14:25:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 3037 states have (on average 1.6167270332565031) internal successors, (4910), 3043 states have internal predecessors, (4910), 590 states have call successors, (590), 21 states have call predecessors, (590), 24 states have return successors, (663), 589 states have call predecessors, (663), 589 states have call successors, (663) [2025-03-03 14:25:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 6163 transitions. [2025-03-03 14:25:17,966 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 6163 transitions. Word has length 136 [2025-03-03 14:25:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:17,966 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 6163 transitions. [2025-03-03 14:25:17,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 6163 transitions. [2025-03-03 14:25:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:25:17,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:17,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:17,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:25:17,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:17,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2111815249, now seen corresponding path program 1 times [2025-03-03 14:25:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:17,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74162137] [2025-03-03 14:25:17,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:18,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:25:18,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:25:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74162137] [2025-03-03 14:25:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74162137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:18,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:18,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:18,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56977137] [2025-03-03 14:25:18,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:18,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:18,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:18,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:18,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:18,038 INFO L87 Difference]: Start difference. First operand 3652 states and 6163 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:18,182 INFO L93 Difference]: Finished difference Result 8611 states and 14626 transitions. [2025-03-03 14:25:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:18,182 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-03 14:25:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:18,214 INFO L225 Difference]: With dead ends: 8611 [2025-03-03 14:25:18,215 INFO L226 Difference]: Without dead ends: 5762 [2025-03-03 14:25:18,226 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-03-03 14:25:18,227 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 104 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 961 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-03-03 14:25:18,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 961 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2025-03-03 14:25:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5754. [2025-03-03 14:25:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5754 states, 4763 states have (on average 1.6117992861641823) internal successors, (7677), 4769 states have internal predecessors, (7677), 966 states have call successors, (966), 21 states have call predecessors, (966), 24 states have return successors, (1083), 965 states have call predecessors, (1083), 965 states have call successors, (1083) [2025-03-03 14:25:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 9726 transitions. [2025-03-03 14:25:18,497 INFO L78 Accepts]: Start accepts. Automaton has 5754 states and 9726 transitions. Word has length 137 [2025-03-03 14:25:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:18,497 INFO L471 AbstractCegarLoop]: Abstraction has 5754 states and 9726 transitions. [2025-03-03 14:25:18,497 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5754 states and 9726 transitions. [2025-03-03 14:25:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:25:18,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:18,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:18,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:25:18,520 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:18,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2082253534, now seen corresponding path program 1 times [2025-03-03 14:25:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918489258] [2025-03-03 14:25:18,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:18,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:25:18,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:25:18,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:18,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:18,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918489258] [2025-03-03 14:25:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918489258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163894923] [2025-03-03 14:25:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:18,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:18,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:18,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:18,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:18,579 INFO L87 Difference]: Start difference. First operand 5754 states and 9726 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:18,879 INFO L93 Difference]: Finished difference Result 14123 states and 24023 transitions. [2025-03-03 14:25:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:18,880 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-03 14:25:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:18,942 INFO L225 Difference]: With dead ends: 14123 [2025-03-03 14:25:18,942 INFO L226 Difference]: Without dead ends: 9568 [2025-03-03 14:25:18,962 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-03-03 14:25:18,963 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 102 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 964 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-03-03 14:25:18,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 964 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9568 states. [2025-03-03 14:25:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9568 to 9560. [2025-03-03 14:25:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9560 states, 7963 states have (on average 1.6104483234961697) internal successors, (12824), 7969 states have internal predecessors, (12824), 1572 states have call successors, (1572), 21 states have call predecessors, (1572), 24 states have return successors, (1767), 1571 states have call predecessors, (1767), 1571 states have call successors, (1767) [2025-03-03 14:25:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 16163 transitions. [2025-03-03 14:25:19,396 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 16163 transitions. Word has length 138 [2025-03-03 14:25:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:19,397 INFO L471 AbstractCegarLoop]: Abstraction has 9560 states and 16163 transitions. [2025-03-03 14:25:19,397 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 16163 transitions. [2025-03-03 14:25:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:25:19,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:19,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:19,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:25:19,429 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:19,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:19,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1705378032, now seen corresponding path program 1 times [2025-03-03 14:25:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:19,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802180765] [2025-03-03 14:25:19,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:19,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:19,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:25:19,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:25:19,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:19,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:19,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802180765] [2025-03-03 14:25:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802180765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:19,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:19,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523870495] [2025-03-03 14:25:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:19,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:19,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:19,489 INFO L87 Difference]: Start difference. First operand 9560 states and 16163 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:19,842 INFO L93 Difference]: Finished difference Result 24630 states and 41821 transitions. [2025-03-03 14:25:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:19,843 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-03 14:25:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:19,909 INFO L225 Difference]: With dead ends: 24630 [2025-03-03 14:25:19,909 INFO L226 Difference]: Without dead ends: 16744 [2025-03-03 14:25:19,940 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-03-03 14:25:19,941 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 100 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 989 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-03-03 14:25:19,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 989 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2025-03-03 14:25:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16736. [2025-03-03 14:25:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16736 states, 13936 states have (on average 1.6025401836969002) internal successors, (22333), 13942 states have internal predecessors, (22333), 2775 states have call successors, (2775), 21 states have call predecessors, (2775), 24 states have return successors, (3114), 2774 states have call predecessors, (3114), 2774 states have call successors, (3114) [2025-03-03 14:25:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16736 states to 16736 states and 28222 transitions. [2025-03-03 14:25:20,590 INFO L78 Accepts]: Start accepts. Automaton has 16736 states and 28222 transitions. Word has length 139 [2025-03-03 14:25:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:20,591 INFO L471 AbstractCegarLoop]: Abstraction has 16736 states and 28222 transitions. [2025-03-03 14:25:20,591 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 16736 states and 28222 transitions. [2025-03-03 14:25:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:25:20,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:20,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:25:20,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:20,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1757015393, now seen corresponding path program 1 times [2025-03-03 14:25:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804371804] [2025-03-03 14:25:20,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:20,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:25:20,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:25:20,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804371804] [2025-03-03 14:25:20,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804371804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:20,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:20,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:20,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981456946] [2025-03-03 14:25:20,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:20,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:20,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:20,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:20,790 INFO L87 Difference]: Start difference. First operand 16736 states and 28222 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:21,580 INFO L93 Difference]: Finished difference Result 44211 states and 74899 transitions. [2025-03-03 14:25:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:21,580 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-03 14:25:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:21,695 INFO L225 Difference]: With dead ends: 44211 [2025-03-03 14:25:21,696 INFO L226 Difference]: Without dead ends: 29818 [2025-03-03 14:25:21,738 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-03-03 14:25:21,740 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 98 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 962 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-03-03 14:25:21,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29818 states. [2025-03-03 14:25:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29818 to 29810. [2025-03-03 14:25:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29810 states, 24971 states have (on average 1.5990549036882784) internal successors, (39930), 24977 states have internal predecessors, (39930), 4814 states have call successors, (4814), 21 states have call predecessors, (4814), 24 states have return successors, (5427), 4813 states have call predecessors, (5427), 4813 states have call successors, (5427) [2025-03-03 14:25:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29810 states to 29810 states and 50171 transitions. [2025-03-03 14:25:22,768 INFO L78 Accepts]: Start accepts. Automaton has 29810 states and 50171 transitions. Word has length 140 [2025-03-03 14:25:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:22,769 INFO L471 AbstractCegarLoop]: Abstraction has 29810 states and 50171 transitions. [2025-03-03 14:25:22,769 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 29810 states and 50171 transitions. [2025-03-03 14:25:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:25:22,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:22,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:22,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:25:22,818 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 742181551, now seen corresponding path program 1 times [2025-03-03 14:25:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666266264] [2025-03-03 14:25:22,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:22,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:25:22,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:25:22,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:22,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666266264] [2025-03-03 14:25:22,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666266264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:22,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:22,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284842801] [2025-03-03 14:25:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:22,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:22,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:22,870 INFO L87 Difference]: Start difference. First operand 29810 states and 50171 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:24,082 INFO L93 Difference]: Finished difference Result 81168 states and 137111 transitions. [2025-03-03 14:25:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:24,083 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-03 14:25:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:24,341 INFO L225 Difference]: With dead ends: 81168 [2025-03-03 14:25:24,341 INFO L226 Difference]: Without dead ends: 54504 [2025-03-03 14:25:24,427 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-03-03 14:25:24,428 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 96 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:24,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 973 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54504 states. [2025-03-03 14:25:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54504 to 54496. [2025-03-03 14:25:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54496 states, 45942 states have (on average 1.594140437943494) internal successors, (73238), 45948 states have internal predecessors, (73238), 8529 states have call successors, (8529), 21 states have call predecessors, (8529), 24 states have return successors, (9674), 8528 states have call predecessors, (9674), 8528 states have call successors, (9674) [2025-03-03 14:25:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54496 states to 54496 states and 91441 transitions. [2025-03-03 14:25:26,722 INFO L78 Accepts]: Start accepts. Automaton has 54496 states and 91441 transitions. Word has length 141 [2025-03-03 14:25:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:26,723 INFO L471 AbstractCegarLoop]: Abstraction has 54496 states and 91441 transitions. [2025-03-03 14:25:26,723 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 54496 states and 91441 transitions. [2025-03-03 14:25:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:25:26,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:26,773 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:25:26,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:25:26,774 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:26,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash 420595456, now seen corresponding path program 1 times [2025-03-03 14:25:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:26,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534619372] [2025-03-03 14:25:26,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:26,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:26,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:25:26,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:25:26,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:26,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534619372] [2025-03-03 14:25:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534619372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:26,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933498744] [2025-03-03 14:25:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:26,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:26,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:26,830 INFO L87 Difference]: Start difference. First operand 54496 states and 91441 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:28,633 INFO L93 Difference]: Finished difference Result 101714 states and 171018 transitions. [2025-03-03 14:25:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:28,633 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-03-03 14:25:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:29,131 INFO L225 Difference]: With dead ends: 101714 [2025-03-03 14:25:29,131 INFO L226 Difference]: Without dead ends: 101545 [2025-03-03 14:25:29,195 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-03-03 14:25:29,197 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 91 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 976 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-03-03 14:25:29,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 976 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101545 states. [2025-03-03 14:25:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101545 to 101537. [2025-03-03 14:25:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101537 states, 86184 states have (on average 1.587719298245614) internal successors, (136836), 86190 states have internal predecessors, (136836), 15328 states have call successors, (15328), 21 states have call predecessors, (15328), 24 states have return successors, (17519), 15327 states have call predecessors, (17519), 15327 states have call successors, (17519) [2025-03-03 14:25:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101537 states to 101537 states and 169683 transitions. [2025-03-03 14:25:32,724 INFO L78 Accepts]: Start accepts. Automaton has 101537 states and 169683 transitions. Word has length 142 [2025-03-03 14:25:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:32,724 INFO L471 AbstractCegarLoop]: Abstraction has 101537 states and 169683 transitions. [2025-03-03 14:25:32,725 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:25:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 101537 states and 169683 transitions. [2025-03-03 14:25:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:25:32,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:32,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:32,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:25:32,803 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1395700690, now seen corresponding path program 1 times [2025-03-03 14:25:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:32,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300080031] [2025-03-03 14:25:32,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:32,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:25:32,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:25:32,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:32,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:25:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300080031] [2025-03-03 14:25:33,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300080031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65934006] [2025-03-03 14:25:33,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:33,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:33,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:33,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:33,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:25:33,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:25:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:25:33,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:33,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:33,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:25:33,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:25:34,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65934006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:34,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:34,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-03-03 14:25:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422703393] [2025-03-03 14:25:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:34,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:25:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:34,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:25:34,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:25:34,132 INFO L87 Difference]: Start difference. First operand 101537 states and 169683 transitions. Second operand has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-03 14:25:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:38,013 INFO L93 Difference]: Finished difference Result 202377 states and 343685 transitions. [2025-03-03 14:25:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:25:38,013 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 143 [2025-03-03 14:25:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:38,874 INFO L225 Difference]: With dead ends: 202377 [2025-03-03 14:25:38,874 INFO L226 Difference]: Without dead ends: 202214 [2025-03-03 14:25:38,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 135 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-03-03 14:25:38,963 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 799 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 5222 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:38,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 5222 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:25:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202214 states. [2025-03-03 14:25:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202214 to 202184. [2025-03-03 14:25:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202184 states, 171671 states have (on average 1.5885385417455482) internal successors, (272706), 171573 states have internal predecessors, (272706), 30453 states have call successors, (30453), 53 states have call predecessors, (30453), 59 states have return successors, (38109), 30563 states have call predecessors, (38109), 30450 states have call successors, (38109) [2025-03-03 14:25:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202184 states to 202184 states and 341268 transitions. [2025-03-03 14:25:46,482 INFO L78 Accepts]: Start accepts. Automaton has 202184 states and 341268 transitions. Word has length 143 [2025-03-03 14:25:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:46,482 INFO L471 AbstractCegarLoop]: Abstraction has 202184 states and 341268 transitions. [2025-03-03 14:25:46,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-03 14:25:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 202184 states and 341268 transitions. [2025-03-03 14:25:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:25:46,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:46,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:46,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:25:46,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:46,805 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:46,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1014223964, now seen corresponding path program 1 times [2025-03-03 14:25:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:46,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061639753] [2025-03-03 14:25:46,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:46,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:25:46,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:25:46,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:46,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:46,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:46,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061639753] [2025-03-03 14:25:46,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061639753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:46,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:25:46,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090724632] [2025-03-03 14:25:46,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:46,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:25:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:46,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:25:46,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:25:46,881 INFO L87 Difference]: Start difference. First operand 202184 states and 341268 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)