./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product22.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b01b58381ce8e0150d6e0f0de264371fec0586e2ead4f1a313de13afba1fd67c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:26:48,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:26:48,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:26:48,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:26:48,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:26:48,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:26:48,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:26:48,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:26:48,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:26:48,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:26:48,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:26:48,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:26:48,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:26:48,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:26:48,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:26:48,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:26:48,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:26:48,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:26:48,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:26:48,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:26:48,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:26:48,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:48,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:26:48,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:26:48,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:26:48,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:26:48,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:26:48,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:26:48,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:26:48,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:26:48,243 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 -> b01b58381ce8e0150d6e0f0de264371fec0586e2ead4f1a313de13afba1fd67c [2025-03-03 14:26:48,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:26:48,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:26:48,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:26:48,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:26:48,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:26:48,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product22.cil.c [2025-03-03 14:26:49,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2de035d/e93fc3bb96884c59b3c991ecb93f9071/FLAG49b13efd8 [2025-03-03 14:26:49,867 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:26:49,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product22.cil.c [2025-03-03 14:26:49,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2de035d/e93fc3bb96884c59b3c991ecb93f9071/FLAG49b13efd8 [2025-03-03 14:26:50,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2de035d/e93fc3bb96884c59b3c991ecb93f9071 [2025-03-03 14:26:50,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:26:50,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:26:50,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:50,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:26:50,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:26:50,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30704e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50, skipping insertion in model container [2025-03-03 14:26:50,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:26:50,465 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_spec8_product22.cil.c[29813,29826] [2025-03-03 14:26:50,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:50,571 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:26:50,578 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:26:50,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [375] [2025-03-03 14:26:50,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [787] [2025-03-03 14:26:50,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1006] [2025-03-03 14:26:50,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1372] [2025-03-03 14:26:50,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1381] [2025-03-03 14:26:50,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1398] [2025-03-03 14:26:50,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1704] [2025-03-03 14:26:50,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1739] [2025-03-03 14:26:50,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2804] [2025-03-03 14:26:50,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2907] [2025-03-03 14:26:50,622 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_spec8_product22.cil.c[29813,29826] [2025-03-03 14:26:50,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:50,696 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:26:50,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50 WrapperNode [2025-03-03 14:26:50,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:50,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:50,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:26:50,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:26:50,702 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:26:50" (1/1) ... [2025-03-03 14:26:50,720 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:26:50" (1/1) ... [2025-03-03 14:26:50,763 INFO L138 Inliner]: procedures = 129, calls = 193, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 1035 [2025-03-03 14:26:50,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:50,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:26:50,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:26:50,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:26:50,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,812 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:26:50,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:26:50,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:26:50,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:26:50,844 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:26:50,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (1/1) ... [2025-03-03 14:26:50,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:50,872 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:26:50,875 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:26:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:26:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:26:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:26:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:26:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:26:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:26:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:26:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:26:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:26:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:26:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:26:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:26:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:26:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:26:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:26:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:26:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:26:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:26:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:26:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:26:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:26:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:26:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:26:51,069 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:26:51,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:26:51,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2860-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2025-03-03 14:26:51,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~37#1; [2025-03-03 14:26:51,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2299-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~31#1; [2025-03-03 14:26:51,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~20#1; [2025-03-03 14:26:51,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-1: isReadable_#res#1 := isReadable_~retValue_acc~41#1; [2025-03-03 14:26:51,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781-1: getClientId_#res#1 := getClientId_~retValue_acc~39#1; [2025-03-03 14:26:51,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~38#1; [2025-03-03 14:26:51,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2346-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~32#1; [2025-03-03 14:26:51,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L431-1: getEmailId_#res#1 := getEmailId_~retValue_acc~2#1; [2025-03-03 14:26:51,401 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L505: #res := ~retValue_acc~4; [2025-03-03 14:26:51,428 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2393-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~33#1; [2025-03-03 14:26:51,428 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: #res#1 := ~retValue_acc~34#1; [2025-03-03 14:26:51,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2904-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-03-03 14:26:51,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: #res := ~retValue_acc~7; [2025-03-03 14:26:51,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1621-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~17#1; [2025-03-03 14:26:51,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1630-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~18#1; [2025-03-03 14:26:51,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1639-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~19#1; [2025-03-03 14:26:51,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~36#1; [2025-03-03 14:26:51,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~35#1; [2025-03-03 14:26:51,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-03 14:26:51,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: #res := ~retValue_acc~3; [2025-03-03 14:26:51,733 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: #res := ~retValue_acc~8; [2025-03-03 14:26:51,815 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-03-03 14:26:51,815 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:26:51,831 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:26:51,831 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:26:51,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:51 BoogieIcfgContainer [2025-03-03 14:26:51,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:26:51,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:26:51,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:26:51,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:26:51,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:26:50" (1/3) ... [2025-03-03 14:26:51,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12422433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:51, skipping insertion in model container [2025-03-03 14:26:51,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:50" (2/3) ... [2025-03-03 14:26:51,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12422433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:51, skipping insertion in model container [2025-03-03 14:26:51,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:51" (3/3) ... [2025-03-03 14:26:51,838 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product22.cil.c [2025-03-03 14:26:51,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:26:51,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product22.cil.c that has 19 procedures, 321 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:26:51,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:26:51,926 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;@76c510b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:26:51,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:26:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 321 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 255 states have internal predecessors, (383), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:26:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:26:51,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:51,940 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:26:51,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:51,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1769501510, now seen corresponding path program 1 times [2025-03-03 14:26:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:51,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22892033] [2025-03-03 14:26:51,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:52,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:26:52,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:26:52,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:52,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22892033] [2025-03-03 14:26:52,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22892033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596645698] [2025-03-03 14:26:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:52,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:52,471 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:26:52,473 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:26:52,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:26:52,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:26:52,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:52,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:26:52,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:52,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596645698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:26:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836997625] [2025-03-03 14:26:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:52,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:26:52,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:26:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:52,792 INFO L87 Difference]: Start difference. First operand has 321 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 255 states have internal predecessors, (383), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:52,831 INFO L93 Difference]: Finished difference Result 484 states and 714 transitions. [2025-03-03 14:26:52,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:26:52,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-03-03 14:26:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:52,844 INFO L225 Difference]: With dead ends: 484 [2025-03-03 14:26:52,845 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 14:26:52,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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:26:52,854 INFO L435 NwaCegarLoop]: 480 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, 480 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:26:52,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 14:26:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-03 14:26:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 245 states have (on average 1.5224489795918368) internal successors, (373), 248 states have internal predecessors, (373), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:26:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2025-03-03 14:26:52,906 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 89 [2025-03-03 14:26:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:52,909 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2025-03-03 14:26:52,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2025-03-03 14:26:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:26:52,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:52,916 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:26:52,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:53,116 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:26:53,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1262866736, now seen corresponding path program 1 times [2025-03-03 14:26:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314232734] [2025-03-03 14:26:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:53,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:26:53,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:26:53,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:53,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314232734] [2025-03-03 14:26:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314232734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783008764] [2025-03-03 14:26:53,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:53,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:53,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:53,362 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:26:53,364 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:26:53,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:26:53,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:26:53,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:53,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:26:53,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:53,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783008764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:53,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294796302] [2025-03-03 14:26:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:53,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:53,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:53,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:53,639 INFO L87 Difference]: Start difference. First operand 314 states and 472 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:53,674 INFO L93 Difference]: Finished difference Result 473 states and 695 transitions. [2025-03-03 14:26:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:53,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-03-03 14:26:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:53,676 INFO L225 Difference]: With dead ends: 473 [2025-03-03 14:26:53,676 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 14:26:53,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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:26:53,679 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 940 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:26:53,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 940 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 14:26:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-03 14:26:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 250 states have internal predecessors, (375), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:26:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 474 transitions. [2025-03-03 14:26:53,698 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 474 transitions. Word has length 90 [2025-03-03 14:26:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:53,699 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 474 transitions. [2025-03-03 14:26:53,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 474 transitions. [2025-03-03 14:26:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:26:53,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:53,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:26:53,712 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:26:53,905 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:26:53,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:53,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash -803720660, now seen corresponding path program 1 times [2025-03-03 14:26:53,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:53,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453679598] [2025-03-03 14:26:53,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:53,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:53,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:26:53,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:26:53,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:53,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453679598] [2025-03-03 14:26:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453679598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:54,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027081802] [2025-03-03 14:26:54,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:54,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:54,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:54,079 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:26:54,080 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:26:54,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:26:54,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:26:54,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:54,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:54,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:54,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:54,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:54,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027081802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:54,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:54,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:54,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616961581] [2025-03-03 14:26:54,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:54,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:54,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:54,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:54,341 INFO L87 Difference]: Start difference. First operand 316 states and 474 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:54,373 INFO L93 Difference]: Finished difference Result 666 states and 1014 transitions. [2025-03-03 14:26:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-03 14:26:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:54,377 INFO L225 Difference]: With dead ends: 666 [2025-03-03 14:26:54,377 INFO L226 Difference]: Without dead ends: 377 [2025-03-03 14:26:54,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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:26:54,380 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 115 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 912 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:26:54,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 912 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-03 14:26:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 369. [2025-03-03 14:26:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 289 states have (on average 1.5363321799307958) internal successors, (444), 292 states have internal predecessors, (444), 61 states have call successors, (61), 18 states have call predecessors, (61), 18 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 14:26:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 565 transitions. [2025-03-03 14:26:54,405 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 565 transitions. Word has length 98 [2025-03-03 14:26:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:54,406 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 565 transitions. [2025-03-03 14:26:54,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 565 transitions. [2025-03-03 14:26:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:26:54,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:54,408 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:26:54,415 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:26:54,608 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:26:54,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:54,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash -582497124, now seen corresponding path program 1 times [2025-03-03 14:26:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270501464] [2025-03-03 14:26:54,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:54,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:54,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:26:54,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:26:54,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:54,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270501464] [2025-03-03 14:26:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270501464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829692706] [2025-03-03 14:26:54,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:54,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:54,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:54,756 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:26:54,757 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:26:54,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:26:54,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:26:54,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:54,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:54,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:26:54,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:55,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829692706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:55,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:26:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826687748] [2025-03-03 14:26:55,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:55,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:55,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:55,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:55,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:55,023 INFO L87 Difference]: Start difference. First operand 369 states and 565 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:55,072 INFO L93 Difference]: Finished difference Result 729 states and 1120 transitions. [2025-03-03 14:26:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-03-03 14:26:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:55,077 INFO L225 Difference]: With dead ends: 729 [2025-03-03 14:26:55,077 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 14:26:55,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 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:26:55,079 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 2 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1845 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:26:55,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1845 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 14:26:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-03 14:26:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 290 states have (on average 1.5344827586206897) internal successors, (445), 294 states have internal predecessors, (445), 61 states have call successors, (61), 18 states have call predecessors, (61), 19 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-03-03 14:26:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 568 transitions. [2025-03-03 14:26:55,099 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 568 transitions. Word has length 99 [2025-03-03 14:26:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:55,100 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 568 transitions. [2025-03-03 14:26:55,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 568 transitions. [2025-03-03 14:26:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:26:55,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:55,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-03 14:26:55,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:55,302 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:26:55,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:55,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 663152938, now seen corresponding path program 1 times [2025-03-03 14:26:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570825495] [2025-03-03 14:26:55,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:26:55,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:26:55,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:55,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:26:55,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570825495] [2025-03-03 14:26:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570825495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950737088] [2025-03-03 14:26:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:55,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:55,460 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:26:55,461 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:26:55,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:26:55,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:26:55,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:55,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:55,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:26:55,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:55,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:55,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950737088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:55,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:55,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:26:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425259190] [2025-03-03 14:26:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:55,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:55,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:55,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:55,717 INFO L87 Difference]: Start difference. First operand 371 states and 568 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:55,781 INFO L93 Difference]: Finished difference Result 731 states and 1125 transitions. [2025-03-03 14:26:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:55,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2025-03-03 14:26:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:55,784 INFO L225 Difference]: With dead ends: 731 [2025-03-03 14:26:55,784 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 14:26:55,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 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:26:55,786 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1831 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:26:55,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1831 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 14:26:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-03 14:26:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 291 states have (on average 1.5326460481099657) internal successors, (446), 296 states have internal predecessors, (446), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-03 14:26:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 574 transitions. [2025-03-03 14:26:55,803 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 574 transitions. Word has length 100 [2025-03-03 14:26:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:55,804 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 574 transitions. [2025-03-03 14:26:55,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 574 transitions. [2025-03-03 14:26:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:26:55,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:55,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:55,816 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:26:56,008 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:26:56,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:56,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash -210473309, now seen corresponding path program 1 times [2025-03-03 14:26:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:56,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803356874] [2025-03-03 14:26:56,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:26:56,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:26:56,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:56,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803356874] [2025-03-03 14:26:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803356874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363069884] [2025-03-03 14:26:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:56,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:56,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:56,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:56,124 INFO L87 Difference]: Start difference. First operand 373 states and 574 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:56,163 INFO L93 Difference]: Finished difference Result 723 states and 1116 transitions. [2025-03-03 14:26:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2025-03-03 14:26:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:56,167 INFO L225 Difference]: With dead ends: 723 [2025-03-03 14:26:56,167 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 14:26:56,168 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:26:56,168 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 2 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1849 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:26:56,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1849 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 14:26:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-03 14:26:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 291 states have (on average 1.5326460481099657) internal successors, (446), 296 states have internal predecessors, (446), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-03-03 14:26:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 573 transitions. [2025-03-03 14:26:56,186 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 573 transitions. Word has length 101 [2025-03-03 14:26:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:56,187 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 573 transitions. [2025-03-03 14:26:56,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 573 transitions. [2025-03-03 14:26:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:26:56,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:56,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:56,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:26:56,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1512288429, now seen corresponding path program 2 times [2025-03-03 14:26:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712544671] [2025-03-03 14:26:56,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:26:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:56,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-03 14:26:56,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:26:56,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:26:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:56,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712544671] [2025-03-03 14:26:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712544671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:56,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668105021] [2025-03-03 14:26:56,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:56,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:56,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:56,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:56,280 INFO L87 Difference]: Start difference. First operand 373 states and 573 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:56,320 INFO L93 Difference]: Finished difference Result 721 states and 1111 transitions. [2025-03-03 14:26:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:56,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-03-03 14:26:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:56,323 INFO L225 Difference]: With dead ends: 721 [2025-03-03 14:26:56,323 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 14:26:56,324 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:26:56,324 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:56,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1835 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 14:26:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-03 14:26:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 291 states have (on average 1.5326460481099657) internal successors, (446), 296 states have internal predecessors, (446), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (65), 60 states have call predecessors, (65), 60 states have call successors, (65) [2025-03-03 14:26:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 572 transitions. [2025-03-03 14:26:56,336 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 572 transitions. Word has length 102 [2025-03-03 14:26:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:56,336 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 572 transitions. [2025-03-03 14:26:56,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 572 transitions. [2025-03-03 14:26:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:26:56,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:56,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:56,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:26:56,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:56,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:56,339 INFO L85 PathProgramCache]: Analyzing trace with hash 714444718, now seen corresponding path program 3 times [2025-03-03 14:26:56,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:56,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773618747] [2025-03-03 14:26:56,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:26:56,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:56,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 103 statements into 3 equivalence classes. [2025-03-03 14:26:56,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 91 of 103 statements. [2025-03-03 14:26:56,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:26:56,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:56,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:56,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773618747] [2025-03-03 14:26:56,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773618747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:56,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:56,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:56,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711777180] [2025-03-03 14:26:56,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:56,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:56,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:56,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:56,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:56,419 INFO L87 Difference]: Start difference. First operand 373 states and 572 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:56,464 INFO L93 Difference]: Finished difference Result 723 states and 1117 transitions. [2025-03-03 14:26:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2025-03-03 14:26:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:56,467 INFO L225 Difference]: With dead ends: 723 [2025-03-03 14:26:56,467 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 14:26:56,468 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:26:56,469 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1846 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:26:56,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1846 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 14:26:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-03 14:26:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 292 states have (on average 1.5308219178082192) internal successors, (447), 298 states have internal predecessors, (447), 61 states have call successors, (61), 18 states have call predecessors, (61), 21 states have return successors, (70), 60 states have call predecessors, (70), 60 states have call successors, (70) [2025-03-03 14:26:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 578 transitions. [2025-03-03 14:26:56,480 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 578 transitions. Word has length 103 [2025-03-03 14:26:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:56,481 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 578 transitions. [2025-03-03 14:26:56,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 578 transitions. [2025-03-03 14:26:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:26:56,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:56,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:56,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:26:56,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:56,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -822273034, now seen corresponding path program 1 times [2025-03-03 14:26:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515259366] [2025-03-03 14:26:56,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:56,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:26:56,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:26:56,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:56,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:56,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515259366] [2025-03-03 14:26:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515259366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:56,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:56,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747823872] [2025-03-03 14:26:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:56,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:56,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:56,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:56,590 INFO L87 Difference]: Start difference. First operand 375 states and 578 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:56,625 INFO L93 Difference]: Finished difference Result 729 states and 1127 transitions. [2025-03-03 14:26:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-03-03 14:26:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:56,628 INFO L225 Difference]: With dead ends: 729 [2025-03-03 14:26:56,628 INFO L226 Difference]: Without dead ends: 377 [2025-03-03 14:26:56,629 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:26:56,629 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1852 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:26:56,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1852 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-03 14:26:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-03 14:26:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 293 states have (on average 1.52901023890785) internal successors, (448), 300 states have internal predecessors, (448), 61 states have call successors, (61), 18 states have call predecessors, (61), 22 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-03-03 14:26:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 581 transitions. [2025-03-03 14:26:56,641 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 581 transitions. Word has length 104 [2025-03-03 14:26:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:56,641 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 581 transitions. [2025-03-03 14:26:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 581 transitions. [2025-03-03 14:26:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:26:56,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:56,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:26:56,643 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:56,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:56,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1796600951, now seen corresponding path program 1 times [2025-03-03 14:26:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682553062] [2025-03-03 14:26:56,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:56,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:26:56,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:26:56,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:56,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:26:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682553062] [2025-03-03 14:26:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682553062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771358587] [2025-03-03 14:26:56,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:56,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:56,746 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:26:56,748 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:26:56,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:26:56,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:26:56,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:56,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:56,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:56,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:56,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:26:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771358587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:26:57,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:26:57,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:26:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561895610] [2025-03-03 14:26:57,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:26:57,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:26:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:57,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:26:57,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:57,055 INFO L87 Difference]: Start difference. First operand 377 states and 581 transitions. Second operand has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:26:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:57,574 INFO L93 Difference]: Finished difference Result 1099 states and 1767 transitions. [2025-03-03 14:26:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:26:57,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 105 [2025-03-03 14:26:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:57,579 INFO L225 Difference]: With dead ends: 1099 [2025-03-03 14:26:57,579 INFO L226 Difference]: Without dead ends: 751 [2025-03-03 14:26:57,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 207 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:26:57,581 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 1186 mSDsluCounter, 2900 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:57,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 3369 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:26:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-03 14:26:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 727. [2025-03-03 14:26:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 579 states have (on average 1.5820379965457685) internal successors, (916), 585 states have internal predecessors, (916), 125 states have call successors, (125), 19 states have call predecessors, (125), 22 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-03-03 14:26:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1187 transitions. [2025-03-03 14:26:57,612 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1187 transitions. Word has length 105 [2025-03-03 14:26:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1187 transitions. [2025-03-03 14:26:57,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:26:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1187 transitions. [2025-03-03 14:26:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:26:57,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:57,615 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:26:57,624 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:26:57,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:57,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:57,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1471102184, now seen corresponding path program 1 times [2025-03-03 14:26:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126153260] [2025-03-03 14:26:57,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:57,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:26:57,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:26:57,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:57,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126153260] [2025-03-03 14:26:57,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126153260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:57,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:57,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:57,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149839134] [2025-03-03 14:26:57,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:57,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:57,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:57,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:57,868 INFO L87 Difference]: Start difference. First operand 727 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:57,903 INFO L93 Difference]: Finished difference Result 1704 states and 2827 transitions. [2025-03-03 14:26:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:57,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-03 14:26:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:57,910 INFO L225 Difference]: With dead ends: 1704 [2025-03-03 14:26:57,910 INFO L226 Difference]: Without dead ends: 1055 [2025-03-03 14:26:57,912 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:26:57,913 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 112 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 949 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:26:57,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 949 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-03 14:26:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1047. [2025-03-03 14:26:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 835 states have (on average 1.6) internal successors, (1336), 841 states have internal predecessors, (1336), 189 states have call successors, (189), 19 states have call predecessors, (189), 22 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-03-03 14:26:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1745 transitions. [2025-03-03 14:26:57,964 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1745 transitions. Word has length 108 [2025-03-03 14:26:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:57,964 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1745 transitions. [2025-03-03 14:26:57,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1745 transitions. [2025-03-03 14:26:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:26:57,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:57,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:26:57,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:26:57,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2109668815, now seen corresponding path program 1 times [2025-03-03 14:26:57,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:57,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301244153] [2025-03-03 14:26:57,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:57,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:26:57,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:26:57,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:57,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:58,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:58,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301244153] [2025-03-03 14:26:58,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301244153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:58,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:58,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:58,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060109308] [2025-03-03 14:26:58,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:58,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:58,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:58,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:58,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:58,018 INFO L87 Difference]: Start difference. First operand 1047 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:58,068 INFO L93 Difference]: Finished difference Result 2498 states and 4184 transitions. [2025-03-03 14:26:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:58,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-03 14:26:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:58,079 INFO L225 Difference]: With dead ends: 2498 [2025-03-03 14:26:58,079 INFO L226 Difference]: Without dead ends: 1580 [2025-03-03 14:26:58,082 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:26:58,083 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 110 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:58,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-03 14:26:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1572. [2025-03-03 14:26:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1265 states have (on average 1.607905138339921) internal successors, (2034), 1271 states have internal predecessors, (2034), 284 states have call successors, (284), 19 states have call predecessors, (284), 22 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-03-03 14:26:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2633 transitions. [2025-03-03 14:26:58,149 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2633 transitions. Word has length 109 [2025-03-03 14:26:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:58,150 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2633 transitions. [2025-03-03 14:26:58,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2633 transitions. [2025-03-03 14:26:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:26:58,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:58,155 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:26:58,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:26:58,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:58,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1310522647, now seen corresponding path program 1 times [2025-03-03 14:26:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237424116] [2025-03-03 14:26:58,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:58,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:58,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:26:58,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:26:58,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:58,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237424116] [2025-03-03 14:26:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237424116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:58,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:58,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131133809] [2025-03-03 14:26:58,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:58,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:58,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:58,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:58,215 INFO L87 Difference]: Start difference. First operand 1572 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:58,292 INFO L93 Difference]: Finished difference Result 3687 states and 6218 transitions. [2025-03-03 14:26:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:58,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-03 14:26:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:58,306 INFO L225 Difference]: With dead ends: 3687 [2025-03-03 14:26:58,306 INFO L226 Difference]: Without dead ends: 2376 [2025-03-03 14:26:58,311 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:26:58,312 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 108 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 931 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:26:58,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2025-03-03 14:26:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2368. [2025-03-03 14:26:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1938 states have (on average 1.6140350877192982) internal successors, (3128), 1944 states have internal predecessors, (3128), 407 states have call successors, (407), 19 states have call predecessors, (407), 22 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-03-03 14:26:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3989 transitions. [2025-03-03 14:26:58,414 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3989 transitions. Word has length 110 [2025-03-03 14:26:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:58,414 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3989 transitions. [2025-03-03 14:26:58,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3989 transitions. [2025-03-03 14:26:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:26:58,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:58,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:26:58,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:26:58,422 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:58,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 962842256, now seen corresponding path program 1 times [2025-03-03 14:26:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16285217] [2025-03-03 14:26:58,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:58,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:26:58,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:26:58,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:58,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16285217] [2025-03-03 14:26:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16285217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045516776] [2025-03-03 14:26:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:58,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:58,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:58,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:58,480 INFO L87 Difference]: Start difference. First operand 2368 states and 3989 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:58,601 INFO L93 Difference]: Finished difference Result 5540 states and 9390 transitions. [2025-03-03 14:26:58,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:58,602 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-03 14:26:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:58,620 INFO L225 Difference]: With dead ends: 5540 [2025-03-03 14:26:58,621 INFO L226 Difference]: Without dead ends: 3648 [2025-03-03 14:26:58,626 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:26:58,626 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 106 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 931 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:26:58,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2025-03-03 14:26:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3640. [2025-03-03 14:26:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3640 states, 3031 states have (on average 1.6179478719894425) internal successors, (4904), 3037 states have internal predecessors, (4904), 586 states have call successors, (586), 19 states have call predecessors, (586), 22 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-03-03 14:26:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 6149 transitions. [2025-03-03 14:26:58,820 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 6149 transitions. Word has length 111 [2025-03-03 14:26:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:58,820 INFO L471 AbstractCegarLoop]: Abstraction has 3640 states and 6149 transitions. [2025-03-03 14:26:58,820 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 6149 transitions. [2025-03-03 14:26:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:26:58,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:58,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:58,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:26:58,828 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:58,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:58,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1569829942, now seen corresponding path program 1 times [2025-03-03 14:26:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:58,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247252826] [2025-03-03 14:26:58,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:58,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:26:58,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:26:58,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:58,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247252826] [2025-03-03 14:26:58,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247252826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:58,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:58,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569861216] [2025-03-03 14:26:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:58,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:58,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:58,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:58,870 INFO L87 Difference]: Start difference. First operand 3640 states and 6149 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:59,037 INFO L93 Difference]: Finished difference Result 8587 states and 14598 transitions. [2025-03-03 14:26:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:59,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-03 14:26:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:59,064 INFO L225 Difference]: With dead ends: 8587 [2025-03-03 14:26:59,064 INFO L226 Difference]: Without dead ends: 5750 [2025-03-03 14:26:59,071 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:26:59,072 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 104 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 946 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:26:59,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 946 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2025-03-03 14:26:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 5742. [2025-03-03 14:26:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5742 states, 4757 states have (on average 1.612570948076519) internal successors, (7671), 4763 states have internal predecessors, (7671), 962 states have call successors, (962), 19 states have call predecessors, (962), 22 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-03-03 14:26:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 9712 transitions. [2025-03-03 14:26:59,295 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 9712 transitions. Word has length 112 [2025-03-03 14:26:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:59,295 INFO L471 AbstractCegarLoop]: Abstraction has 5742 states and 9712 transitions. [2025-03-03 14:26:59,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 9712 transitions. [2025-03-03 14:26:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:26:59,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:59,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:59,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:26:59,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:59,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1280695057, now seen corresponding path program 1 times [2025-03-03 14:26:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768274795] [2025-03-03 14:26:59,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:59,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:26:59,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:26:59,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:59,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768274795] [2025-03-03 14:26:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768274795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686612783] [2025-03-03 14:26:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:59,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:59,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:59,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:59,352 INFO L87 Difference]: Start difference. First operand 5742 states and 9712 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:59,588 INFO L93 Difference]: Finished difference Result 14099 states and 23995 transitions. [2025-03-03 14:26:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:59,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-03 14:26:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:59,643 INFO L225 Difference]: With dead ends: 14099 [2025-03-03 14:26:59,643 INFO L226 Difference]: Without dead ends: 9556 [2025-03-03 14:26:59,660 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:26:59,662 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 102 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 936 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:26:59,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 936 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9556 states. [2025-03-03 14:26:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9556 to 9548. [2025-03-03 14:26:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9548 states, 7957 states have (on average 1.6109086339072516) internal successors, (12818), 7963 states have internal predecessors, (12818), 1568 states have call successors, (1568), 19 states have call predecessors, (1568), 22 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-03-03 14:27:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9548 states to 9548 states and 16149 transitions. [2025-03-03 14:27:00,031 INFO L78 Accepts]: Start accepts. Automaton has 9548 states and 16149 transitions. Word has length 113 [2025-03-03 14:27:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:00,031 INFO L471 AbstractCegarLoop]: Abstraction has 9548 states and 16149 transitions. [2025-03-03 14:27:00,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 9548 states and 16149 transitions. [2025-03-03 14:27:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:27:00,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:00,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:27:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:27:00,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:00,047 INFO L85 PathProgramCache]: Analyzing trace with hash 883897995, now seen corresponding path program 1 times [2025-03-03 14:27:00,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604429038] [2025-03-03 14:27:00,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:00,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:27:00,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:27:00,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:00,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:00,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:00,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604429038] [2025-03-03 14:27:00,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604429038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:00,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:00,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:00,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117173317] [2025-03-03 14:27:00,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:00,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:00,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:00,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:00,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:00,095 INFO L87 Difference]: Start difference. First operand 9548 states and 16149 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:00,587 INFO L93 Difference]: Finished difference Result 24606 states and 41793 transitions. [2025-03-03 14:27:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:00,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-03-03 14:27:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:00,663 INFO L225 Difference]: With dead ends: 24606 [2025-03-03 14:27:00,664 INFO L226 Difference]: Without dead ends: 16732 [2025-03-03 14:27:00,701 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:27:00,702 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 100 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 955 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:27:00,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 955 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16732 states. [2025-03-03 14:27:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16732 to 16724. [2025-03-03 14:27:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16724 states, 13930 states have (on average 1.602799712849964) internal successors, (22327), 13936 states have internal predecessors, (22327), 2771 states have call successors, (2771), 19 states have call predecessors, (2771), 22 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-03-03 14:27:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16724 states to 16724 states and 28208 transitions. [2025-03-03 14:27:01,279 INFO L78 Accepts]: Start accepts. Automaton has 16724 states and 28208 transitions. Word has length 114 [2025-03-03 14:27:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:01,279 INFO L471 AbstractCegarLoop]: Abstraction has 16724 states and 28208 transitions. [2025-03-03 14:27:01,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 16724 states and 28208 transitions. [2025-03-03 14:27:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:27:01,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:01,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:27:01,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:27:01,297 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1055845326, now seen corresponding path program 1 times [2025-03-03 14:27:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:01,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621593063] [2025-03-03 14:27:01,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:01,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:27:01,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:27:01,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:01,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621593063] [2025-03-03 14:27:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621593063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:01,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57821540] [2025-03-03 14:27:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:01,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:01,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:01,417 INFO L87 Difference]: Start difference. First operand 16724 states and 28208 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:01,977 INFO L93 Difference]: Finished difference Result 44187 states and 74871 transitions. [2025-03-03 14:27:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:01,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-03-03 14:27:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:02,082 INFO L225 Difference]: With dead ends: 44187 [2025-03-03 14:27:02,083 INFO L226 Difference]: Without dead ends: 29806 [2025-03-03 14:27:02,125 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:27:02,126 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 98 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:02,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29806 states. [2025-03-03 14:27:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29806 to 29798. [2025-03-03 14:27:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29798 states, 24965 states have (on average 1.5991988784298017) internal successors, (39924), 24971 states have internal predecessors, (39924), 4810 states have call successors, (4810), 19 states have call predecessors, (4810), 22 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-03-03 14:27:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29798 states to 29798 states and 50157 transitions. [2025-03-03 14:27:03,455 INFO L78 Accepts]: Start accepts. Automaton has 29798 states and 50157 transitions. Word has length 115 [2025-03-03 14:27:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:03,456 INFO L471 AbstractCegarLoop]: Abstraction has 29798 states and 50157 transitions. [2025-03-03 14:27:03,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29798 states and 50157 transitions. [2025-03-03 14:27:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:27:03,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:03,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:03,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:27:03,478 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:03,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash 286344748, now seen corresponding path program 1 times [2025-03-03 14:27:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551088890] [2025-03-03 14:27:03,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:27:03,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:27:03,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:03,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:03,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:03,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551088890] [2025-03-03 14:27:03,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551088890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:03,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:03,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:03,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922529776] [2025-03-03 14:27:03,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:03,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:03,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:03,532 INFO L87 Difference]: Start difference. First operand 29798 states and 50157 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:04,511 INFO L93 Difference]: Finished difference Result 81144 states and 137083 transitions. [2025-03-03 14:27:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:04,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2025-03-03 14:27:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:04,708 INFO L225 Difference]: With dead ends: 81144 [2025-03-03 14:27:04,708 INFO L226 Difference]: Without dead ends: 54492 [2025-03-03 14:27:04,760 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:27:04,761 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 96 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:04,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54492 states. [2025-03-03 14:27:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54492 to 54484. [2025-03-03 14:27:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54484 states, 45936 states have (on average 1.5942180424939045) internal successors, (73232), 45942 states have internal predecessors, (73232), 8525 states have call successors, (8525), 19 states have call predecessors, (8525), 22 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-03-03 14:27:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54484 states to 54484 states and 91427 transitions. [2025-03-03 14:27:06,295 INFO L78 Accepts]: Start accepts. Automaton has 54484 states and 91427 transitions. Word has length 116 [2025-03-03 14:27:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:06,295 INFO L471 AbstractCegarLoop]: Abstraction has 54484 states and 91427 transitions. [2025-03-03 14:27:06,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 54484 states and 91427 transitions. [2025-03-03 14:27:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:27:06,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:06,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:27:06,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:27:06,533 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:06,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1293090291, now seen corresponding path program 1 times [2025-03-03 14:27:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651228091] [2025-03-03 14:27:06,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:06,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:27:06,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:27:06,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:06,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651228091] [2025-03-03 14:27:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651228091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536191852] [2025-03-03 14:27:06,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,599 INFO L87 Difference]: Start difference. First operand 54484 states and 91427 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:08,797 INFO L93 Difference]: Finished difference Result 101690 states and 170990 transitions. [2025-03-03 14:27:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-03-03 14:27:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:09,266 INFO L225 Difference]: With dead ends: 101690 [2025-03-03 14:27:09,266 INFO L226 Difference]: Without dead ends: 101533 [2025-03-03 14:27:09,334 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:27:09,335 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 91 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:09,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101533 states. [2025-03-03 14:27:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101533 to 101525. [2025-03-03 14:27:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101525 states, 86178 states have (on average 1.5877602172248138) internal successors, (136830), 86184 states have internal predecessors, (136830), 15324 states have call successors, (15324), 19 states have call predecessors, (15324), 22 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-03-03 14:27:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101525 states to 101525 states and 169669 transitions. [2025-03-03 14:27:12,486 INFO L78 Accepts]: Start accepts. Automaton has 101525 states and 169669 transitions. Word has length 117 [2025-03-03 14:27:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:12,487 INFO L471 AbstractCegarLoop]: Abstraction has 101525 states and 169669 transitions. [2025-03-03 14:27:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:27:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 101525 states and 169669 transitions. [2025-03-03 14:27:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:27:12,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:12,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:27:12,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:27:12,512 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:12,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1587074573, now seen corresponding path program 1 times [2025-03-03 14:27:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:12,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581682088] [2025-03-03 14:27:12,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:12,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:27:12,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:27:12,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:12,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581682088] [2025-03-03 14:27:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581682088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:12,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:27:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670752356] [2025-03-03 14:27:12,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:12,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:27:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:12,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:27:12,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:27:12,801 INFO L87 Difference]: Start difference. First operand 101525 states and 169669 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-03 14:27:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:17,903 INFO L93 Difference]: Finished difference Result 202336 states and 343643 transitions. [2025-03-03 14:27:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:27:17,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 118 [2025-03-03 14:27:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:18,871 INFO L225 Difference]: With dead ends: 202336 [2025-03-03 14:27:18,871 INFO L226 Difference]: Without dead ends: 202185 [2025-03-03 14:27:18,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:27:18,981 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1220 mSDsluCounter, 4921 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:18,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 5512 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:27:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202185 states. [2025-03-03 14:27:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202185 to 202148. [2025-03-03 14:27:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202148 states, 171653 states have (on average 1.588600257496228) internal successors, (272688), 171555 states have internal predecessors, (272688), 30441 states have call successors, (30441), 47 states have call predecessors, (30441), 53 states have return successors, (38097), 30551 states have call predecessors, (38097), 30438 states have call successors, (38097) [2025-03-03 14:27:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202148 states to 202148 states and 341226 transitions. [2025-03-03 14:27:26,742 INFO L78 Accepts]: Start accepts. Automaton has 202148 states and 341226 transitions. Word has length 118 [2025-03-03 14:27:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:26,742 INFO L471 AbstractCegarLoop]: Abstraction has 202148 states and 341226 transitions. [2025-03-03 14:27:26,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-03 14:27:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 202148 states and 341226 transitions. [2025-03-03 14:27:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:27:26,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:26,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:27:26,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:27:26,779 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:26,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash 618606716, now seen corresponding path program 1 times [2025-03-03 14:27:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608478950] [2025-03-03 14:27:26,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:26,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:27:26,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:27:26,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:26,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608478950] [2025-03-03 14:27:26,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608478950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:26,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:26,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:27:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297674714] [2025-03-03 14:27:26,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:26,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:27:26,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:26,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:27:26,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:27:26,908 INFO L87 Difference]: Start difference. First operand 202148 states and 341226 transitions. Second operand has 9 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)