./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product30.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_spec11_product30.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 e4fb36b23f327758af91661b12ca1735faf7949901dbd5c1543c17ea0384ceb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:20:46,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:20:46,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:20:46,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:20:46,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:20:46,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:20:46,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:20:46,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:20:46,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:20:46,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:20:46,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:20:46,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:20:46,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:20:46,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:20:46,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:20:46,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:20:46,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:20:46,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:20:46,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:20:46,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:20:46,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:20:46,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:20:46,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:20:46,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:20:46,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:46,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:20:46,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:20:46,635 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 -> e4fb36b23f327758af91661b12ca1735faf7949901dbd5c1543c17ea0384ceb9 [2025-03-03 14:20:46,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:20:46,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:20:46,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:20:46,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:20:46,875 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:20:46,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product30.cil.c [2025-03-03 14:20:48,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114d165b3/4ea398caef0b4fcbacc561b91ad782e1/FLAG44af6c42e [2025-03-03 14:20:48,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:20:48,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product30.cil.c [2025-03-03 14:20:48,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114d165b3/4ea398caef0b4fcbacc561b91ad782e1/FLAG44af6c42e [2025-03-03 14:20:48,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114d165b3/4ea398caef0b4fcbacc561b91ad782e1 [2025-03-03 14:20:48,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:20:48,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:20:48,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:48,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:20:48,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:20:48,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:48" (1/1) ... [2025-03-03 14:20:48,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7973a023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:48, skipping insertion in model container [2025-03-03 14:20:48,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:48" (1/1) ... [2025-03-03 14:20:48,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:20:48,828 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_spec11_product30.cil.c[29507,29520] [2025-03-03 14:20:48,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:48,926 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:20:48,932 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-03-03 14:20:48,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [443] [2025-03-03 14:20:48,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [668] [2025-03-03 14:20:48,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [685] [2025-03-03 14:20:48,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [705] [2025-03-03 14:20:48,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1104] [2025-03-03 14:20:48,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1240] [2025-03-03 14:20:48,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1278] [2025-03-03 14:20:48,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1560] [2025-03-03 14:20:48,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1569] [2025-03-03 14:20:48,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1935] [2025-03-03 14:20:48,996 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_spec11_product30.cil.c[29507,29520] [2025-03-03 14:20:49,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:49,059 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:20:49,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49 WrapperNode [2025-03-03 14:20:49,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:49,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:49,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:20:49,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:20:49,067 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:20:49" (1/1) ... [2025-03-03 14:20:49,082 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:20:49" (1/1) ... [2025-03-03 14:20:49,124 INFO L138 Inliner]: procedures = 131, calls = 203, calls flagged for inlining = 60, calls inlined = 50, statements flattened = 902 [2025-03-03 14:20:49,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:49,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:20:49,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:20:49,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:20:49,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,166 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:20:49,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:20:49,186 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:20:49,186 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:20:49,186 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:20:49,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (1/1) ... [2025-03-03 14:20:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:49,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:49,223 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:20:49,228 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:20:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:20:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:20:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:20:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:20:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:20:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:20:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:20:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:20:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:20:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:20:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:20:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:20:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:20:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:20:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:20:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:20:49,245 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:20:49,245 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:20:49,245 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:20:49,245 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:20:49,245 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:20:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:20:49,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:20:49,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:20:49,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:20:49,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2497-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~35#1; [2025-03-03 14:20:49,632 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-03 14:20:49,641 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1011: #res := ~retValue_acc~14; [2025-03-03 14:20:49,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L340: #res := ~retValue_acc~4; [2025-03-03 14:20:49,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2591-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-03 14:20:49,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636: #res#1 := ~retValue_acc~38#1; [2025-03-03 14:20:49,735 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2860: #res := ~retValue_acc~41; [2025-03-03 14:20:49,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544: #res := ~retValue_acc~36; [2025-03-03 14:20:49,752 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-1: createEmail_#res#1 := createEmail_~retValue_acc~20#1; [2025-03-03 14:20:49,766 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: #res := ~retValue_acc~12; [2025-03-03 14:20:49,777 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L974: #res := ~retValue_acc~13; [2025-03-03 14:20:49,784 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: #res := ~retValue_acc~15; [2025-03-03 14:20:49,805 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L822: #res := ~retValue_acc~9; [2025-03-03 14:20:50,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1275-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-03 14:20:50,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2806-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-03 14:20:50,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-03 14:20:50,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L297-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~1#1; [2025-03-03 14:20:50,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L306-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~2#1; [2025-03-03 14:20:50,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L315-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~3#1; [2025-03-03 14:20:50,089 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L785: #res := ~retValue_acc~8; [2025-03-03 14:20:50,100 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1213: #res#1 := ~retValue_acc~18#1; [2025-03-03 14:20:50,100 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1193-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~17#1; [2025-03-03 14:20:50,219 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-03-03 14:20:50,219 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:20:50,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:20:50,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:20:50,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:50 BoogieIcfgContainer [2025-03-03 14:20:50,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:20:50,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:20:50,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:20:50,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:20:50,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:20:48" (1/3) ... [2025-03-03 14:20:50,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a2f49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:50, skipping insertion in model container [2025-03-03 14:20:50,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:49" (2/3) ... [2025-03-03 14:20:50,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a2f49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:50, skipping insertion in model container [2025-03-03 14:20:50,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:50" (3/3) ... [2025-03-03 14:20:50,243 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product30.cil.c [2025-03-03 14:20:50,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:20:50,257 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product30.cil.c that has 24 procedures, 343 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:20:50,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:20:50,316 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;@53e322c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:20:50,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:20:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 266 states have (on average 1.5150375939849625) internal successors, (403), 270 states have internal predecessors, (403), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:20:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:20:50,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:50,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:50,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:50,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash 309880528, now seen corresponding path program 1 times [2025-03-03 14:20:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308632376] [2025-03-03 14:20:50,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:50,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:20:50,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:20:50,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 14:20:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308632376] [2025-03-03 14:20:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308632376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370353830] [2025-03-03 14:20:50,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:50,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:50,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:50,983 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:20:50,984 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:20:51,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:20:51,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:20:51,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:51,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:51,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:20:51,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:20:51,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370353830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:51,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:20:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497961928] [2025-03-03 14:20:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:20:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:51,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:20:51,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:51,349 INFO L87 Difference]: Start difference. First operand has 343 states, 266 states have (on average 1.5150375939849625) internal successors, (403), 270 states have internal predecessors, (403), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:51,394 INFO L93 Difference]: Finished difference Result 533 states and 770 transitions. [2025-03-03 14:20:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:20:51,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-03 14:20:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:51,409 INFO L225 Difference]: With dead ends: 533 [2025-03-03 14:20:51,409 INFO L226 Difference]: Without dead ends: 336 [2025-03-03 14:20:51,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 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:20:51,414 INFO L435 NwaCegarLoop]: 504 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, 504 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:20:51,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-03 14:20:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-03-03 14:20:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 260 states have (on average 1.5115384615384615) internal successors, (393), 263 states have internal predecessors, (393), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:20:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 496 transitions. [2025-03-03 14:20:51,466 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 496 transitions. Word has length 139 [2025-03-03 14:20:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 496 transitions. [2025-03-03 14:20:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 496 transitions. [2025-03-03 14:20:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:20:51,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:51,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:51,486 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:20:51,677 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:20:51,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:51,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1267400000, now seen corresponding path program 1 times [2025-03-03 14:20:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:51,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430740761] [2025-03-03 14:20:51,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:51,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:20:51,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:20:51,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:51,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 14:20:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430740761] [2025-03-03 14:20:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430740761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406324860] [2025-03-03 14:20:51,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:51,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:51,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:51,952 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:20:51,953 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:20:52,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:20:52,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:20:52,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:52,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:52,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:20:52,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:20:52,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406324860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:52,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:20:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792611515] [2025-03-03 14:20:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:52,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:52,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:52,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:52,317 INFO L87 Difference]: Start difference. First operand 336 states and 496 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:52,363 INFO L93 Difference]: Finished difference Result 522 states and 751 transitions. [2025-03-03 14:20:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2025-03-03 14:20:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:52,367 INFO L225 Difference]: With dead ends: 522 [2025-03-03 14:20:52,370 INFO L226 Difference]: Without dead ends: 338 [2025-03-03 14:20:52,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 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:20:52,372 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 988 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:20:52,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 988 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-03 14:20:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-03-03 14:20:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 265 states have internal predecessors, (395), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:20:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2025-03-03 14:20:52,400 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 498 transitions. Word has length 140 [2025-03-03 14:20:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 498 transitions. [2025-03-03 14:20:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2025-03-03 14:20:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:20:52,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:52,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:52,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:20:52,604 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:20:52,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:52,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:52,605 INFO L85 PathProgramCache]: Analyzing trace with hash 373788754, now seen corresponding path program 1 times [2025-03-03 14:20:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:52,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099400638] [2025-03-03 14:20:52,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:52,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:20:52,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:20:52,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:52,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:20:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099400638] [2025-03-03 14:20:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099400638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656202770] [2025-03-03 14:20:52,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:52,839 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:20:52,840 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:20:53,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:20:53,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:20:53,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:53,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:53,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:53,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:20:53,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:53,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656202770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:53,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:53,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:20:53,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893494401] [2025-03-03 14:20:53,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:53,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:53,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:53,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:53,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:53,144 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:53,182 INFO L93 Difference]: Finished difference Result 705 states and 1054 transitions. [2025-03-03 14:20:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2025-03-03 14:20:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:53,186 INFO L225 Difference]: With dead ends: 705 [2025-03-03 14:20:53,186 INFO L226 Difference]: Without dead ends: 394 [2025-03-03 14:20:53,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:20:53,190 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 107 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 965 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:20:53,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 965 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-03 14:20:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 386. [2025-03-03 14:20:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 299 states have (on average 1.5250836120401339) internal successors, (456), 302 states have internal predecessors, (456), 63 states have call successors, (63), 23 states have call predecessors, (63), 23 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 14:20:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 581 transitions. [2025-03-03 14:20:53,220 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 581 transitions. Word has length 148 [2025-03-03 14:20:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:53,220 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 581 transitions. [2025-03-03 14:20:53,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 581 transitions. [2025-03-03 14:20:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:20:53,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:53,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:53,237 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:20:53,425 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:20:53,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -729231512, now seen corresponding path program 1 times [2025-03-03 14:20:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:53,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58120721] [2025-03-03 14:20:53,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:53,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:20:53,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:20:53,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:53,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:20:53,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58120721] [2025-03-03 14:20:53,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58120721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546000930] [2025-03-03 14:20:53,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:53,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:53,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:53,597 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:20:53,598 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:20:53,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:20:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:20:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:53,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:20:53,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:20:53,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546000930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:20:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718742167] [2025-03-03 14:20:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:53,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:53,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:53,903 INFO L87 Difference]: Start difference. First operand 386 states and 581 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:53,960 INFO L93 Difference]: Finished difference Result 763 states and 1152 transitions. [2025-03-03 14:20:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 149 [2025-03-03 14:20:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:53,963 INFO L225 Difference]: With dead ends: 763 [2025-03-03 14:20:53,963 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 14:20:53,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 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:20:53,966 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1941 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:20:53,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1941 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 14:20:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-03-03 14:20:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 300 states have (on average 1.5233333333333334) internal successors, (457), 304 states have internal predecessors, (457), 63 states have call successors, (63), 23 states have call predecessors, (63), 24 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2025-03-03 14:20:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 584 transitions. [2025-03-03 14:20:53,985 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 584 transitions. Word has length 149 [2025-03-03 14:20:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 584 transitions. [2025-03-03 14:20:53,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 584 transitions. [2025-03-03 14:20:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:20:53,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:53,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:53,997 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:20:54,189 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:20:54,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1057545812, now seen corresponding path program 1 times [2025-03-03 14:20:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:54,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294927136] [2025-03-03 14:20:54,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:54,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:20:54,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:20:54,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:54,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:20:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294927136] [2025-03-03 14:20:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294927136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522054918] [2025-03-03 14:20:54,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:54,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:54,367 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:20:54,368 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:20:54,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:20:54,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:20:54,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:54,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:54,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:20:54,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:20:54,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522054918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:54,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:20:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548742425] [2025-03-03 14:20:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:54,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:54,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:54,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:54,662 INFO L87 Difference]: Start difference. First operand 388 states and 584 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:54,716 INFO L93 Difference]: Finished difference Result 765 states and 1157 transitions. [2025-03-03 14:20:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 150 [2025-03-03 14:20:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:54,720 INFO L225 Difference]: With dead ends: 765 [2025-03-03 14:20:54,720 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 14:20:54,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 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:20:54,726 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 2 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1927 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:20:54,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1927 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 14:20:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-03 14:20:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 301 states have (on average 1.521594684385382) internal successors, (458), 306 states have internal predecessors, (458), 63 states have call successors, (63), 23 states have call predecessors, (63), 25 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2025-03-03 14:20:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 590 transitions. [2025-03-03 14:20:54,744 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 590 transitions. Word has length 150 [2025-03-03 14:20:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:54,744 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 590 transitions. [2025-03-03 14:20:54,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 590 transitions. [2025-03-03 14:20:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:20:54,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:54,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:54,754 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:20:54,946 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:20:54,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:54,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1269631698, now seen corresponding path program 1 times [2025-03-03 14:20:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509346995] [2025-03-03 14:20:54,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:54,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:20:54,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:20:54,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:54,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:20:55,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:55,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509346995] [2025-03-03 14:20:55,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509346995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:55,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:55,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:55,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142786826] [2025-03-03 14:20:55,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:55,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:55,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:55,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:55,116 INFO L87 Difference]: Start difference. First operand 390 states and 590 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:55,160 INFO L93 Difference]: Finished difference Result 757 states and 1148 transitions. [2025-03-03 14:20:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 151 [2025-03-03 14:20:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:55,164 INFO L225 Difference]: With dead ends: 757 [2025-03-03 14:20:55,164 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 14:20:55,166 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:20:55,166 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1945 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:20:55,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1945 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 14:20:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-03 14:20:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 301 states have (on average 1.521594684385382) internal successors, (458), 306 states have internal predecessors, (458), 63 states have call successors, (63), 23 states have call predecessors, (63), 25 states have return successors, (68), 62 states have call predecessors, (68), 62 states have call successors, (68) [2025-03-03 14:20:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 589 transitions. [2025-03-03 14:20:55,187 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 589 transitions. Word has length 151 [2025-03-03 14:20:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:55,187 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 589 transitions. [2025-03-03 14:20:55,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 589 transitions. [2025-03-03 14:20:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:20:55,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:55,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:20:55,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2076015684, now seen corresponding path program 2 times [2025-03-03 14:20:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219602039] [2025-03-03 14:20:55,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:20:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:55,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-03 14:20:55,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 59 of 152 statements. [2025-03-03 14:20:55,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:20:55,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:20:55,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219602039] [2025-03-03 14:20:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219602039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426610583] [2025-03-03 14:20:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:55,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:55,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:55,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:55,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:55,352 INFO L87 Difference]: Start difference. First operand 390 states and 589 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:55,711 INFO L93 Difference]: Finished difference Result 1049 states and 1565 transitions. [2025-03-03 14:20:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:20:55,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2025-03-03 14:20:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:55,717 INFO L225 Difference]: With dead ends: 1049 [2025-03-03 14:20:55,717 INFO L226 Difference]: Without dead ends: 871 [2025-03-03 14:20:55,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:20:55,719 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 593 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 3450 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:55,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 3450 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:20:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-03 14:20:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 775. [2025-03-03 14:20:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 600 states have (on average 1.5266666666666666) internal successors, (916), 607 states have internal predecessors, (916), 124 states have call successors, (124), 47 states have call predecessors, (124), 50 states have return successors, (138), 124 states have call predecessors, (138), 122 states have call successors, (138) [2025-03-03 14:20:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1178 transitions. [2025-03-03 14:20:55,764 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1178 transitions. Word has length 152 [2025-03-03 14:20:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:55,765 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1178 transitions. [2025-03-03 14:20:55,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1178 transitions. [2025-03-03 14:20:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:20:55,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:55,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:55,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:20:55,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:55,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1783252409, now seen corresponding path program 1 times [2025-03-03 14:20:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:55,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274493142] [2025-03-03 14:20:55,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:55,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:20:55,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:20:55,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:55,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:20:55,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:55,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274493142] [2025-03-03 14:20:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274493142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:55,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:55,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147988637] [2025-03-03 14:20:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:55,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:55,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:55,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:55,913 INFO L87 Difference]: Start difference. First operand 775 states and 1178 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:55,958 INFO L93 Difference]: Finished difference Result 1519 states and 2316 transitions. [2025-03-03 14:20:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:55,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 153 [2025-03-03 14:20:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:55,963 INFO L225 Difference]: With dead ends: 1519 [2025-03-03 14:20:55,963 INFO L226 Difference]: Without dead ends: 779 [2025-03-03 14:20:55,965 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:20:55,966 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1948 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:20:55,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1948 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-03 14:20:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2025-03-03 14:20:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 602 states have (on average 1.5249169435215948) internal successors, (918), 611 states have internal predecessors, (918), 124 states have call successors, (124), 47 states have call predecessors, (124), 52 states have return successors, (141), 124 states have call predecessors, (141), 122 states have call successors, (141) [2025-03-03 14:20:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1183 transitions. [2025-03-03 14:20:55,995 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1183 transitions. Word has length 153 [2025-03-03 14:20:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:55,995 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1183 transitions. [2025-03-03 14:20:55,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1183 transitions. [2025-03-03 14:20:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:20:55,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:55,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:55,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:20:55,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:56,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1844194076, now seen corresponding path program 1 times [2025-03-03 14:20:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:56,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748140928] [2025-03-03 14:20:56,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:56,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:20:56,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:20:56,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:56,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:20:56,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748140928] [2025-03-03 14:20:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748140928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15165550] [2025-03-03 14:20:56,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:56,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:56,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:56,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:56,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:56,129 INFO L87 Difference]: Start difference. First operand 779 states and 1183 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:20:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:56,249 INFO L93 Difference]: Finished difference Result 1517 states and 2308 transitions. [2025-03-03 14:20:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:20:56,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 154 [2025-03-03 14:20:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:56,254 INFO L225 Difference]: With dead ends: 1517 [2025-03-03 14:20:56,255 INFO L226 Difference]: Without dead ends: 783 [2025-03-03 14:20:56,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:20:56,258 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 7 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:56,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3331 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-03 14:20:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 781. [2025-03-03 14:20:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 604 states have (on average 1.5231788079470199) internal successors, (920), 612 states have internal predecessors, (920), 124 states have call successors, (124), 48 states have call predecessors, (124), 52 states have return successors, (139), 124 states have call predecessors, (139), 122 states have call successors, (139) [2025-03-03 14:20:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1183 transitions. [2025-03-03 14:20:56,287 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1183 transitions. Word has length 154 [2025-03-03 14:20:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:56,288 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1183 transitions. [2025-03-03 14:20:56,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:20:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1183 transitions. [2025-03-03 14:20:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:20:56,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:56,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:20:56,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:56,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 75751346, now seen corresponding path program 2 times [2025-03-03 14:20:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581059436] [2025-03-03 14:20:56,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:20:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:56,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-03-03 14:20:56,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 155 statements. [2025-03-03 14:20:56,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:20:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:20:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581059436] [2025-03-03 14:20:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581059436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:56,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946929228] [2025-03-03 14:20:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:56,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:56,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:56,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:56,459 INFO L87 Difference]: Start difference. First operand 781 states and 1183 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:56,854 INFO L93 Difference]: Finished difference Result 2107 states and 3158 transitions. [2025-03-03 14:20:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:20:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 155 [2025-03-03 14:20:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:56,863 INFO L225 Difference]: With dead ends: 2107 [2025-03-03 14:20:56,863 INFO L226 Difference]: Without dead ends: 1749 [2025-03-03 14:20:56,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:20:56,866 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 577 mSDsluCounter, 3047 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:56,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 3584 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:20:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-03 14:20:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1559. [2025-03-03 14:20:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1206 states have (on average 1.5248756218905473) internal successors, (1839), 1224 states have internal predecessors, (1839), 244 states have call successors, (244), 96 states have call predecessors, (244), 108 states have return successors, (300), 246 states have call predecessors, (300), 240 states have call successors, (300) [2025-03-03 14:20:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2383 transitions. [2025-03-03 14:20:56,946 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2383 transitions. Word has length 155 [2025-03-03 14:20:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:56,946 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2383 transitions. [2025-03-03 14:20:56,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:20:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2383 transitions. [2025-03-03 14:20:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:20:56,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:56,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:56,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:20:56,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:56,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:56,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1649935515, now seen corresponding path program 1 times [2025-03-03 14:20:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076701706] [2025-03-03 14:20:56,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:56,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:20:56,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:20:56,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 14:20:57,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:57,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076701706] [2025-03-03 14:20:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076701706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:57,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894321997] [2025-03-03 14:20:57,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:57,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:57,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:57,074 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:20:57,075 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:20:57,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:20:57,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:20:57,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:57,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:57,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:20:57,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:57,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:57,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894321997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:57,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:20:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949035614] [2025-03-03 14:20:57,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:57,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:57,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:57,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:57,410 INFO L87 Difference]: Start difference. First operand 1559 states and 2383 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:57,484 INFO L93 Difference]: Finished difference Result 2351 states and 3586 transitions. [2025-03-03 14:20:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2025-03-03 14:20:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:57,492 INFO L225 Difference]: With dead ends: 2351 [2025-03-03 14:20:57,492 INFO L226 Difference]: Without dead ends: 1563 [2025-03-03 14:20:57,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 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:20:57,495 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:57,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1938 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-03 14:20:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1555. [2025-03-03 14:20:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1204 states have (on average 1.5249169435215948) internal successors, (1836), 1222 states have internal predecessors, (1836), 242 states have call successors, (242), 96 states have call predecessors, (242), 108 states have return successors, (298), 244 states have call predecessors, (298), 238 states have call successors, (298) [2025-03-03 14:20:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2376 transitions. [2025-03-03 14:20:57,559 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2376 transitions. Word has length 155 [2025-03-03 14:20:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:57,559 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2376 transitions. [2025-03-03 14:20:57,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2376 transitions. [2025-03-03 14:20:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 14:20:57,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:57,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:57,573 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:20:57,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:57,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:57,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash 217677318, now seen corresponding path program 1 times [2025-03-03 14:20:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643626029] [2025-03-03 14:20:57,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:57,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:20:57,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:20:57,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:57,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:20:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:57,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643626029] [2025-03-03 14:20:57,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643626029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:57,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:57,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397364713] [2025-03-03 14:20:57,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:57,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:57,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:57,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:57,903 INFO L87 Difference]: Start difference. First operand 1555 states and 2376 transitions. Second operand has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:20:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:58,059 INFO L93 Difference]: Finished difference Result 3049 states and 4666 transitions. [2025-03-03 14:20:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:20:58,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 156 [2025-03-03 14:20:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:58,071 INFO L225 Difference]: With dead ends: 3049 [2025-03-03 14:20:58,071 INFO L226 Difference]: Without dead ends: 1563 [2025-03-03 14:20:58,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:20:58,079 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 5 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:58,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3345 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-03 14:20:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1559. [2025-03-03 14:20:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1208 states have (on average 1.5231788079470199) internal successors, (1840), 1225 states have internal predecessors, (1840), 242 states have call successors, (242), 97 states have call predecessors, (242), 108 states have return successors, (294), 244 states have call predecessors, (294), 238 states have call successors, (294) [2025-03-03 14:20:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2376 transitions. [2025-03-03 14:20:58,183 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2376 transitions. Word has length 156 [2025-03-03 14:20:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:58,183 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2376 transitions. [2025-03-03 14:20:58,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:20:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2376 transitions. [2025-03-03 14:20:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 14:20:58,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:58,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:58,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:20:58,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -541539561, now seen corresponding path program 1 times [2025-03-03 14:20:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784316104] [2025-03-03 14:20:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:58,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:20:58,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:20:58,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:58,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:20:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784316104] [2025-03-03 14:20:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784316104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192990059] [2025-03-03 14:20:58,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:58,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:58,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:58,374 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:20:58,375 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:20:58,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:20:58,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:20:58,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:58,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:58,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:58,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:20:58,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:20:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:20:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192990059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:20:58,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:20:58,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:20:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324384742] [2025-03-03 14:20:58,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:20:58,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:20:58,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:58,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:20:58,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:58,783 INFO L87 Difference]: Start difference. First operand 1559 states and 2376 transitions. Second operand has 11 states, 10 states have (on average 15.3) internal successors, (153), 11 states have internal predecessors, (153), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 14:20:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:59,358 INFO L93 Difference]: Finished difference Result 4425 states and 7104 transitions. [2025-03-03 14:20:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:20:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.3) internal successors, (153), 11 states have internal predecessors, (153), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 157 [2025-03-03 14:20:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:59,372 INFO L225 Difference]: With dead ends: 4425 [2025-03-03 14:20:59,373 INFO L226 Difference]: Without dead ends: 2949 [2025-03-03 14:20:59,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 311 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:20:59,378 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1167 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 3794 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:59,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 3794 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:20:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2025-03-03 14:20:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2853. [2025-03-03 14:20:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2246 states have (on average 1.578806767586821) internal successors, (3546), 2262 states have internal predecessors, (3546), 498 states have call successors, (498), 98 states have call predecessors, (498), 108 states have return successors, (630), 500 states have call predecessors, (630), 494 states have call successors, (630) [2025-03-03 14:20:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4674 transitions. [2025-03-03 14:20:59,499 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4674 transitions. Word has length 157 [2025-03-03 14:20:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:59,499 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4674 transitions. [2025-03-03 14:20:59,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.3) internal successors, (153), 11 states have internal predecessors, (153), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 14:20:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4674 transitions. [2025-03-03 14:20:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:20:59,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:59,513 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:59,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:20:59,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:59,714 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:59,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1168373564, now seen corresponding path program 1 times [2025-03-03 14:20:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093253488] [2025-03-03 14:20:59,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:59,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:20:59,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:20:59,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:59,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:20:59,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:59,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093253488] [2025-03-03 14:20:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093253488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:59,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:59,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216837438] [2025-03-03 14:20:59,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:59,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:59,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:59,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:59,766 INFO L87 Difference]: Start difference. First operand 2853 states and 4674 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:20:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:59,894 INFO L93 Difference]: Finished difference Result 6651 states and 11110 transitions. [2025-03-03 14:20:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 160 [2025-03-03 14:20:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:59,913 INFO L225 Difference]: With dead ends: 6651 [2025-03-03 14:20:59,913 INFO L226 Difference]: Without dead ends: 4065 [2025-03-03 14:20:59,920 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:20:59,921 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 104 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 995 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:20:59,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 995 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2025-03-03 14:21:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 4033. [2025-03-03 14:21:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4033 states, 3170 states have (on average 1.5981072555205047) internal successors, (5066), 3186 states have internal predecessors, (5066), 754 states have call successors, (754), 98 states have call predecessors, (754), 108 states have return successors, (966), 756 states have call predecessors, (966), 750 states have call successors, (966) [2025-03-03 14:21:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 6786 transitions. [2025-03-03 14:21:00,135 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 6786 transitions. Word has length 160 [2025-03-03 14:21:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:00,135 INFO L471 AbstractCegarLoop]: Abstraction has 4033 states and 6786 transitions. [2025-03-03 14:21:00,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 6786 transitions. [2025-03-03 14:21:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:21:00,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:00,157 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:00,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:21:00,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:00,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1551544375, now seen corresponding path program 1 times [2025-03-03 14:21:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510284895] [2025-03-03 14:21:00,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:00,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:21:00,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:21:00,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:00,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:00,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:00,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510284895] [2025-03-03 14:21:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510284895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:00,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663363188] [2025-03-03 14:21:00,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:00,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:00,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:00,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:00,219 INFO L87 Difference]: Start difference. First operand 4033 states and 6786 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:00,380 INFO L93 Difference]: Finished difference Result 9567 states and 16226 transitions. [2025-03-03 14:21:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 161 [2025-03-03 14:21:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:00,410 INFO L225 Difference]: With dead ends: 9567 [2025-03-03 14:21:00,410 INFO L226 Difference]: Without dead ends: 6005 [2025-03-03 14:21:00,422 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:21:00,423 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 102 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 984 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:21:00,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 984 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2025-03-03 14:21:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 5973. [2025-03-03 14:21:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5973 states, 4730 states have (on average 1.6071881606765328) internal successors, (7602), 4746 states have internal predecessors, (7602), 1134 states have call successors, (1134), 98 states have call predecessors, (1134), 108 states have return successors, (1410), 1136 states have call predecessors, (1410), 1130 states have call successors, (1410) [2025-03-03 14:21:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5973 states to 5973 states and 10146 transitions. [2025-03-03 14:21:00,671 INFO L78 Accepts]: Start accepts. Automaton has 5973 states and 10146 transitions. Word has length 161 [2025-03-03 14:21:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:00,671 INFO L471 AbstractCegarLoop]: Abstraction has 5973 states and 10146 transitions. [2025-03-03 14:21:00,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5973 states and 10146 transitions. [2025-03-03 14:21:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:21:00,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:00,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:00,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:21:00,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:00,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1332339523, now seen corresponding path program 1 times [2025-03-03 14:21:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951765311] [2025-03-03 14:21:00,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:00,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:21:00,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:21:00,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:00,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951765311] [2025-03-03 14:21:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951765311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:00,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:00,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468522163] [2025-03-03 14:21:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:00,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:00,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:00,750 INFO L87 Difference]: Start difference. First operand 5973 states and 10146 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:00,965 INFO L93 Difference]: Finished difference Result 13903 states and 23858 transitions. [2025-03-03 14:21:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:00,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 162 [2025-03-03 14:21:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:01,009 INFO L225 Difference]: With dead ends: 13903 [2025-03-03 14:21:01,009 INFO L226 Difference]: Without dead ends: 8929 [2025-03-03 14:21:01,030 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:21:01,031 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 100 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 979 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:21:01,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 979 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2025-03-03 14:21:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 8897. [2025-03-03 14:21:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8897 states, 7162 states have (on average 1.614353532532812) internal successors, (11562), 7178 states have internal predecessors, (11562), 1626 states have call successors, (1626), 98 states have call predecessors, (1626), 108 states have return successors, (2070), 1628 states have call predecessors, (2070), 1622 states have call successors, (2070) [2025-03-03 14:21:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 15258 transitions. [2025-03-03 14:21:01,389 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 15258 transitions. Word has length 162 [2025-03-03 14:21:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:01,389 INFO L471 AbstractCegarLoop]: Abstraction has 8897 states and 15258 transitions. [2025-03-03 14:21:01,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 15258 transitions. [2025-03-03 14:21:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:21:01,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:01,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:01,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:21:01,432 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:01,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1164467368, now seen corresponding path program 1 times [2025-03-03 14:21:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370028323] [2025-03-03 14:21:01,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:01,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:21:01,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:21:01,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:01,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370028323] [2025-03-03 14:21:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370028323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:01,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:01,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:01,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413776091] [2025-03-03 14:21:01,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:01,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:01,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:01,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:01,488 INFO L87 Difference]: Start difference. First operand 8897 states and 15258 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:01,919 INFO L93 Difference]: Finished difference Result 20615 states and 35706 transitions. [2025-03-03 14:21:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:01,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2025-03-03 14:21:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:01,988 INFO L225 Difference]: With dead ends: 20615 [2025-03-03 14:21:01,989 INFO L226 Difference]: Without dead ends: 13577 [2025-03-03 14:21:02,024 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:21:02,025 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 98 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 979 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:21:02,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 979 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13577 states. [2025-03-03 14:21:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13577 to 13545. [2025-03-03 14:21:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13545 states, 11094 states have (on average 1.6190733729944113) internal successors, (17962), 11110 states have internal predecessors, (17962), 2342 states have call successors, (2342), 98 states have call predecessors, (2342), 108 states have return successors, (3066), 2344 states have call predecessors, (3066), 2338 states have call successors, (3066) [2025-03-03 14:21:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13545 states to 13545 states and 23370 transitions. [2025-03-03 14:21:02,581 INFO L78 Accepts]: Start accepts. Automaton has 13545 states and 23370 transitions. Word has length 163 [2025-03-03 14:21:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:02,581 INFO L471 AbstractCegarLoop]: Abstraction has 13545 states and 23370 transitions. [2025-03-03 14:21:02,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 13545 states and 23370 transitions. [2025-03-03 14:21:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 14:21:02,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:02,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:02,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:21:02,637 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 617870622, now seen corresponding path program 1 times [2025-03-03 14:21:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293723981] [2025-03-03 14:21:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:02,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:21:02,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:21:02,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:02,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:02,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293723981] [2025-03-03 14:21:02,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293723981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:02,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:02,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:02,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310062872] [2025-03-03 14:21:02,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:02,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:02,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:02,687 INFO L87 Difference]: Start difference. First operand 13545 states and 23370 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:03,077 INFO L93 Difference]: Finished difference Result 32683 states and 56834 transitions. [2025-03-03 14:21:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 164 [2025-03-03 14:21:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:03,165 INFO L225 Difference]: With dead ends: 32683 [2025-03-03 14:21:03,165 INFO L226 Difference]: Without dead ends: 21985 [2025-03-03 14:21:03,200 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:21:03,200 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 96 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:03,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1006 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21985 states. [2025-03-03 14:21:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21985 to 21953. [2025-03-03 14:21:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21953 states, 17998 states have (on average 1.6129569952216913) internal successors, (29030), 18014 states have internal predecessors, (29030), 3846 states have call successors, (3846), 98 states have call predecessors, (3846), 108 states have return successors, (5058), 3848 states have call predecessors, (5058), 3842 states have call successors, (5058) [2025-03-03 14:21:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21953 states to 21953 states and 37934 transitions. [2025-03-03 14:21:04,137 INFO L78 Accepts]: Start accepts. Automaton has 21953 states and 37934 transitions. Word has length 164 [2025-03-03 14:21:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:04,137 INFO L471 AbstractCegarLoop]: Abstraction has 21953 states and 37934 transitions. [2025-03-03 14:21:04,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 21953 states and 37934 transitions. [2025-03-03 14:21:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:21:04,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:04,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:04,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:21:04,233 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1796406713, now seen corresponding path program 1 times [2025-03-03 14:21:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91147523] [2025-03-03 14:21:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:04,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:21:04,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:21:04,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:04,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:04,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91147523] [2025-03-03 14:21:04,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91147523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:04,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895285130] [2025-03-03 14:21:04,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:04,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:04,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:04,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:04,304 INFO L87 Difference]: Start difference. First operand 21953 states and 37934 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:05,392 INFO L93 Difference]: Finished difference Result 53951 states and 93686 transitions. [2025-03-03 14:21:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:05,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 165 [2025-03-03 14:21:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:05,555 INFO L225 Difference]: With dead ends: 53951 [2025-03-03 14:21:05,555 INFO L226 Difference]: Without dead ends: 36429 [2025-03-03 14:21:05,600 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:21:05,601 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 94 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 986 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:21:05,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 986 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36429 states. [2025-03-03 14:21:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36429 to 36397. [2025-03-03 14:21:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36397 states, 30018 states have (on average 1.6113665134252781) internal successors, (48370), 30034 states have internal predecessors, (48370), 6270 states have call successors, (6270), 98 states have call predecessors, (6270), 108 states have return successors, (8082), 6272 states have call predecessors, (8082), 6266 states have call successors, (8082) [2025-03-03 14:21:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36397 states to 36397 states and 62722 transitions. [2025-03-03 14:21:06,825 INFO L78 Accepts]: Start accepts. Automaton has 36397 states and 62722 transitions. Word has length 165 [2025-03-03 14:21:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:06,826 INFO L471 AbstractCegarLoop]: Abstraction has 36397 states and 62722 transitions. [2025-03-03 14:21:06,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 36397 states and 62722 transitions. [2025-03-03 14:21:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:21:06,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:06,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:21:06,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:06,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1005239841, now seen corresponding path program 1 times [2025-03-03 14:21:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605061829] [2025-03-03 14:21:06,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:06,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:21:06,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:21:06,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:06,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:07,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:07,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605061829] [2025-03-03 14:21:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605061829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795398397] [2025-03-03 14:21:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:07,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:07,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:07,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:07,009 INFO L87 Difference]: Start difference. First operand 36397 states and 62722 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:08,698 INFO L93 Difference]: Finished difference Result 93879 states and 162642 transitions. [2025-03-03 14:21:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2025-03-03 14:21:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:09,041 INFO L225 Difference]: With dead ends: 93879 [2025-03-03 14:21:09,041 INFO L226 Difference]: Without dead ends: 63693 [2025-03-03 14:21:09,163 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:21:09,165 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 92 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1004 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:21:09,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1004 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63693 states. [2025-03-03 14:21:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63693 to 63661. [2025-03-03 14:21:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63661 states, 52470 states have (on average 1.6028587764436821) internal successors, (84102), 52486 states have internal predecessors, (84102), 11082 states have call successors, (11082), 98 states have call predecessors, (11082), 108 states have return successors, (14306), 11084 states have call predecessors, (14306), 11078 states have call successors, (14306) [2025-03-03 14:21:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63661 states to 63661 states and 109490 transitions. [2025-03-03 14:21:11,661 INFO L78 Accepts]: Start accepts. Automaton has 63661 states and 109490 transitions. Word has length 166 [2025-03-03 14:21:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:11,661 INFO L471 AbstractCegarLoop]: Abstraction has 63661 states and 109490 transitions. [2025-03-03 14:21:11,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 63661 states and 109490 transitions. [2025-03-03 14:21:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:21:11,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:11,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:11,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:21:11,890 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:11,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1414260518, now seen corresponding path program 1 times [2025-03-03 14:21:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132148077] [2025-03-03 14:21:11,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:11,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:21:11,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:21:11,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:11,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132148077] [2025-03-03 14:21:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132148077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697736690] [2025-03-03 14:21:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:11,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:11,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:11,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:11,947 INFO L87 Difference]: Start difference. First operand 63661 states and 109490 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:15,396 INFO L93 Difference]: Finished difference Result 168163 states and 290910 transitions. [2025-03-03 14:21:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 167 [2025-03-03 14:21:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:16,012 INFO L225 Difference]: With dead ends: 168163 [2025-03-03 14:21:16,012 INFO L226 Difference]: Without dead ends: 113249 [2025-03-03 14:21:16,135 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:21:16,137 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 90 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 982 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:21:16,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 982 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113249 states. [2025-03-03 14:21:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113249 to 113217. [2025-03-03 14:21:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113217 states, 93870 states have (on average 1.5990838393522957) internal successors, (150106), 93886 states have internal predecessors, (150106), 19238 states have call successors, (19238), 98 states have call predecessors, (19238), 108 states have return successors, (25170), 19240 states have call predecessors, (25170), 19234 states have call successors, (25170) [2025-03-03 14:21:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113217 states to 113217 states and 194514 transitions. [2025-03-03 14:21:20,202 INFO L78 Accepts]: Start accepts. Automaton has 113217 states and 194514 transitions. Word has length 167 [2025-03-03 14:21:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 113217 states and 194514 transitions. [2025-03-03 14:21:20,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:21:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 113217 states and 194514 transitions. [2025-03-03 14:21:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:21:20,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:20,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:20,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:21:20,531 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:20,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash 153543552, now seen corresponding path program 1 times [2025-03-03 14:21:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457036146] [2025-03-03 14:21:20,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:20,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:21:20,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:21:20,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:20,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:21:20,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457036146] [2025-03-03 14:21:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457036146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:20,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:20,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129416611] [2025-03-03 14:21:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:20,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:20,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:20,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:20,585 INFO L87 Difference]: Start difference. First operand 113217 states and 194514 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)