./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec11_productSimulator.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 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:30:49,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:30:49,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:30:49,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:30:49,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:30:49,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:30:49,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:30:49,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:30:49,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:30:49,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:30:49,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:30:49,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:30:49,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:30:49,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:49,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:30:49,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:30:49,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:30:49,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:30:49,163 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 -> 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 [2025-03-08 05:30:49,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:30:49,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:30:49,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:30:49,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:30:49,412 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:30:49,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2025-03-08 05:30:50,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2929621e9/59f6ee109bb244678368b319cde6b4c2/FLAG9b072594a [2025-03-08 05:30:50,957 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:30:50,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2025-03-08 05:30:50,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2929621e9/59f6ee109bb244678368b319cde6b4c2/FLAG9b072594a [2025-03-08 05:30:50,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2929621e9/59f6ee109bb244678368b319cde6b4c2 [2025-03-08 05:30:50,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:30:50,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:30:51,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:51,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:30:51,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:30:51,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:50" (1/1) ... [2025-03-08 05:30:51,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c7a50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51, skipping insertion in model container [2025-03-08 05:30:51,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:50" (1/1) ... [2025-03-08 05:30:51,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:30:51,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c[48047,48060] [2025-03-08 05:30:51,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:51,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:30:51,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-08 05:30:51,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2025-03-08 05:30:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [754] [2025-03-08 05:30:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1126] [2025-03-08 05:30:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1492] [2025-03-08 05:30:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1698] [2025-03-08 05:30:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2095] [2025-03-08 05:30:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2112] [2025-03-08 05:30:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2378] [2025-03-08 05:30:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2387] [2025-03-08 05:30:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [3447] [2025-03-08 05:30:51,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c[48047,48060] [2025-03-08 05:30:51,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:51,609 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:30:51,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51 WrapperNode [2025-03-08 05:30:51,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:51,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:51,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:30:51,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:30:51,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,683 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1308 [2025-03-08 05:30:51,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:51,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:30:51,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:30:51,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:30:51,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,740 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-08 05:30:51,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:30:51,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:30:51,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:30:51,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:30:51,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (1/1) ... [2025-03-08 05:30:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:51,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:51,822 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-08 05:30:51,824 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-08 05:30:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:30:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:30:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-08 05:30:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-08 05:30:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-08 05:30:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-08 05:30:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:30:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:30:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:30:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:30:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:30:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:30:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:30:51,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:30:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-08 05:30:51,848 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-08 05:30:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:30:51,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:30:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-08 05:30:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-08 05:30:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:30:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:30:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:30:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:30:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:30:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:30:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-08 05:30:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-08 05:30:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-08 05:30:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-08 05:30:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:30:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:30:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:30:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:30:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:30:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:30:52,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:30:52,019 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:30:52,047 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1633: #res := ~retValue_acc~11; [2025-03-08 05:30:52,056 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2002: #res := ~retValue_acc~24; [2025-03-08 05:30:52,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: #res := ~retValue_acc~6; [2025-03-08 05:30:52,076 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2989: #res := ~retValue_acc~37; [2025-03-08 05:30:52,156 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2533: #res := ~retValue_acc~31; [2025-03-08 05:30:52,195 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1739-1: getEmailId_#res#1 := getEmailId_~retValue_acc~17#1; [2025-03-08 05:30:52,228 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: #res := ~retValue_acc~23; [2025-03-08 05:30:52,247 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: #res := ~retValue_acc~19; [2025-03-08 05:30:52,322 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~12#1; [2025-03-08 05:30:52,322 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671: #res#1 := ~retValue_acc~13#1; [2025-03-08 05:30:52,413 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~38#1; [2025-03-08 05:30:52,413 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081: #res#1 := ~retValue_acc~39#1; [2025-03-08 05:30:52,463 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3305: #res := ~retValue_acc~42; [2025-03-08 05:30:52,470 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695-1: createEmail_#res#1 := createEmail_~retValue_acc~15#1; [2025-03-08 05:30:52,476 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: #res := ~retValue_acc~22; [2025-03-08 05:30:52,511 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424-1: getClientId_#res#1 := getClientId_~retValue_acc~44#1; [2025-03-08 05:30:52,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2076-1: isVerified_#res#1 := isVerified_~retValue_acc~26#1; [2025-03-08 05:30:52,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3377-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~43#1; [2025-03-08 05:30:52,557 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2039: #res := ~retValue_acc~25; [2025-03-08 05:30:52,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: #res := ~retValue_acc~0; [2025-03-08 05:30:52,605 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: #res := ~retValue_acc~35; [2025-03-08 05:30:52,630 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~36#1; [2025-03-08 05:30:52,878 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L598-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~4#1; [2025-03-08 05:30:52,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3144-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~40#1; [2025-03-08 05:30:52,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L589-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~3#1; [2025-03-08 05:30:52,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L607-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~5#1; [2025-03-08 05:30:52,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3251-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~41#1; [2025-03-08 05:30:52,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L165-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:30:52,884 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1776: #res := ~retValue_acc~18; [2025-03-08 05:30:53,132 INFO L? ?]: Removed 626 outVars from TransFormulas that were not future-live. [2025-03-08 05:30:53,132 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:30:53,148 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:30:53,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:30:53,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:53 BoogieIcfgContainer [2025-03-08 05:30:53,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:30:53,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:30:53,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:30:53,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:30:53,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:30:50" (1/3) ... [2025-03-08 05:30:53,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63edd060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:53, skipping insertion in model container [2025-03-08 05:30:53,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:51" (2/3) ... [2025-03-08 05:30:53,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63edd060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:53, skipping insertion in model container [2025-03-08 05:30:53,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:53" (3/3) ... [2025-03-08 05:30:53,158 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_productSimulator.cil.c [2025-03-08 05:30:53,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:30:53,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_productSimulator.cil.c that has 44 procedures, 598 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:30:53,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:30:53,261 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;@59ce992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:30:53,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:30:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 598 states, 444 states have (on average 1.5157657657657657) internal successors, (673), 464 states have internal predecessors, (673), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 05:30:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:30:53,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:53,285 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:53,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:53,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1444288072, now seen corresponding path program 1 times [2025-03-08 05:30:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786698641] [2025-03-08 05:30:53,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:53,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:30:53,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:30:53,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:53,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:30:53,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786698641] [2025-03-08 05:30:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786698641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:53,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:53,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160053881] [2025-03-08 05:30:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:53,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:53,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:53,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:53,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:53,914 INFO L87 Difference]: Start difference. First operand has 598 states, 444 states have (on average 1.5157657657657657) internal successors, (673), 464 states have internal predecessors, (673), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:54,037 INFO L93 Difference]: Finished difference Result 1159 states and 1742 transitions. [2025-03-08 05:30:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:54,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2025-03-08 05:30:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:54,054 INFO L225 Difference]: With dead ends: 1159 [2025-03-08 05:30:54,055 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 05:30:54,059 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-08 05:30:54,062 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 0 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:54,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3527 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 05:30:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-08 05:30:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 438 states have (on average 1.4977168949771689) internal successors, (656), 457 states have internal predecessors, (656), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 05:30:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 873 transitions. [2025-03-08 05:30:54,130 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 873 transitions. Word has length 156 [2025-03-08 05:30:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:54,131 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 873 transitions. [2025-03-08 05:30:54,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 873 transitions. [2025-03-08 05:30:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 05:30:54,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:54,139 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:54,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:30:54,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:54,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1650760197, now seen corresponding path program 1 times [2025-03-08 05:30:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:54,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632834287] [2025-03-08 05:30:54,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:54,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 05:30:54,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:30:54,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:54,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:30:54,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632834287] [2025-03-08 05:30:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632834287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10232989] [2025-03-08 05:30:54,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:54,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:54,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:54,508 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-08 05:30:54,510 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-08 05:30:54,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 05:30:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:30:54,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:54,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:54,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:30:54,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:30:54,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10232989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 05:30:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434563750] [2025-03-08 05:30:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:54,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:54,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:54,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:54,930 INFO L87 Difference]: Start difference. First operand 591 states and 873 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:54,968 INFO L93 Difference]: Finished difference Result 917 states and 1329 transitions. [2025-03-08 05:30:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2025-03-08 05:30:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:54,974 INFO L225 Difference]: With dead ends: 917 [2025-03-08 05:30:54,975 INFO L226 Difference]: Without dead ends: 592 [2025-03-08 05:30:54,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:54,977 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 0 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1742 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-08 05:30:54,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1742 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-08 05:30:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-08 05:30:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.4965831435079726) internal successors, (657), 458 states have internal predecessors, (657), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 05:30:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-03-08 05:30:55,004 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 161 [2025-03-08 05:30:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:55,004 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-03-08 05:30:55,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-03-08 05:30:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:30:55,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:55,008 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:55,017 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-08 05:30:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:55,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:55,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1520962445, now seen corresponding path program 1 times [2025-03-08 05:30:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630304681] [2025-03-08 05:30:55,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:55,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:30:55,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:30:55,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:55,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 05:30:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:55,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630304681] [2025-03-08 05:30:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630304681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444774478] [2025-03-08 05:30:55,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:55,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:55,475 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-08 05:30:55,478 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-08 05:30:55,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:30:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:30:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:55,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:30:55,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 05:30:55,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:55,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444774478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-08 05:30:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56823317] [2025-03-08 05:30:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:55,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:55,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:55,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:30:55,897 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:30:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:55,999 INFO L93 Difference]: Finished difference Result 1131 states and 1677 transitions. [2025-03-08 05:30:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:30:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 166 [2025-03-08 05:30:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:56,004 INFO L225 Difference]: With dead ends: 1131 [2025-03-08 05:30:56,004 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 05:30:56,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:30:56,008 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 4 mSDsluCounter, 4287 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5148 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:56,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5148 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 05:30:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 596. [2025-03-08 05:30:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 441 states have (on average 1.4943310657596371) internal successors, (659), 461 states have internal predecessors, (659), 109 states have call successors, (109), 43 states have call predecessors, (109), 45 states have return successors, (112), 108 states have call predecessors, (112), 108 states have call successors, (112) [2025-03-08 05:30:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 880 transitions. [2025-03-08 05:30:56,036 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 880 transitions. Word has length 166 [2025-03-08 05:30:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:56,037 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 880 transitions. [2025-03-08 05:30:56,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:30:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 880 transitions. [2025-03-08 05:30:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:30:56,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:56,040 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:56,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:56,241 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,SelfDestructingSolverStorable2 [2025-03-08 05:30:56,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:56,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash -75884889, now seen corresponding path program 1 times [2025-03-08 05:30:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685088918] [2025-03-08 05:30:56,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:56,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:30:56,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:30:56,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:56,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 05:30:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:56,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685088918] [2025-03-08 05:30:56,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685088918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:56,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:56,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:30:56,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782727312] [2025-03-08 05:30:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:56,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:56,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:56,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:56,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:56,452 INFO L87 Difference]: Start difference. First operand 596 states and 880 transitions. Second operand has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:30:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:56,539 INFO L93 Difference]: Finished difference Result 1117 states and 1657 transitions. [2025-03-08 05:30:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:30:56,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 167 [2025-03-08 05:30:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:56,545 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 05:30:56,545 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 05:30:56,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:56,548 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 4 mSDsluCounter, 4287 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5148 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:56,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5148 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 05:30:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2025-03-08 05:30:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 442 states have (on average 1.493212669683258) internal successors, (660), 462 states have internal predecessors, (660), 109 states have call successors, (109), 43 states have call predecessors, (109), 46 states have return successors, (113), 109 states have call predecessors, (113), 108 states have call successors, (113) [2025-03-08 05:30:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 882 transitions. [2025-03-08 05:30:56,575 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 882 transitions. Word has length 167 [2025-03-08 05:30:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:56,575 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 882 transitions. [2025-03-08 05:30:56,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:30:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 882 transitions. [2025-03-08 05:30:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:30:56,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:56,578 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:30:56,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1569051783, now seen corresponding path program 2 times [2025-03-08 05:30:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018526470] [2025-03-08 05:30:56,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:30:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:56,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-03-08 05:30:56,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 168 statements. [2025-03-08 05:30:56,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:30:56,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 05:30:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:56,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018526470] [2025-03-08 05:30:56,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018526470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:56,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:56,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919782192] [2025-03-08 05:30:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:56,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:56,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:56,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:56,708 INFO L87 Difference]: Start difference. First operand 598 states and 882 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 05:30:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:56,779 INFO L93 Difference]: Finished difference Result 1432 states and 2113 transitions. [2025-03-08 05:30:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 168 [2025-03-08 05:30:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:56,786 INFO L225 Difference]: With dead ends: 1432 [2025-03-08 05:30:56,786 INFO L226 Difference]: Without dead ends: 1115 [2025-03-08 05:30:56,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:56,789 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 792 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 3383 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:56,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 3383 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-08 05:30:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1113. [2025-03-08 05:30:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 830 states have (on average 1.510843373493976) internal successors, (1254), 866 states have internal predecessors, (1254), 198 states have call successors, (198), 81 states have call predecessors, (198), 84 states have return successors, (201), 196 states have call predecessors, (201), 196 states have call successors, (201) [2025-03-08 05:30:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1653 transitions. [2025-03-08 05:30:56,844 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1653 transitions. Word has length 168 [2025-03-08 05:30:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:56,844 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1653 transitions. [2025-03-08 05:30:56,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 05:30:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1653 transitions. [2025-03-08 05:30:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:30:56,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:56,849 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:56,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:30:56,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:56,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1061377622, now seen corresponding path program 1 times [2025-03-08 05:30:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:56,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404176669] [2025-03-08 05:30:56,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:56,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:30:56,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:30:56,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:56,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 05:30:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404176669] [2025-03-08 05:30:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404176669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:30:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890212930] [2025-03-08 05:30:57,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:57,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:57,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:57,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:57,033 INFO L87 Difference]: Start difference. First operand 1113 states and 1653 transitions. Second operand has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:30:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:57,146 INFO L93 Difference]: Finished difference Result 2151 states and 3205 transitions. [2025-03-08 05:30:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:30:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 169 [2025-03-08 05:30:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:57,153 INFO L225 Difference]: With dead ends: 2151 [2025-03-08 05:30:57,154 INFO L226 Difference]: Without dead ends: 1118 [2025-03-08 05:30:57,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:57,159 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 2 mSDsluCounter, 4307 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5173 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:57,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5173 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-08 05:30:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1115. [2025-03-08 05:30:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 831 states have (on average 1.510228640192539) internal successors, (1255), 868 states have internal predecessors, (1255), 198 states have call successors, (198), 81 states have call predecessors, (198), 85 states have return successors, (204), 196 states have call predecessors, (204), 196 states have call successors, (204) [2025-03-08 05:30:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1657 transitions. [2025-03-08 05:30:57,215 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1657 transitions. Word has length 169 [2025-03-08 05:30:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:57,215 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1657 transitions. [2025-03-08 05:30:57,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:30:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1657 transitions. [2025-03-08 05:30:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 05:30:57,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:57,221 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:57,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:30:57,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:57,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1055995929, now seen corresponding path program 1 times [2025-03-08 05:30:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:57,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136228194] [2025-03-08 05:30:57,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:57,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:57,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:30:57,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:30:57,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:57,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:57,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136228194] [2025-03-08 05:30:57,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136228194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463159117] [2025-03-08 05:30:57,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:57,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:57,370 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-08 05:30:57,372 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-08 05:30:57,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:30:57,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:30:57,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:57,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:57,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:57,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:57,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:30:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463159117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:30:57,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:30:57,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:30:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081406674] [2025-03-08 05:30:57,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:30:57,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:57,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:57,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:57,811 INFO L87 Difference]: Start difference. First operand 1115 states and 1657 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:30:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:57,965 INFO L93 Difference]: Finished difference Result 2394 states and 3636 transitions. [2025-03-08 05:30:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:30:57,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2025-03-08 05:30:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:57,976 INFO L225 Difference]: With dead ends: 2394 [2025-03-08 05:30:57,976 INFO L226 Difference]: Without dead ends: 1744 [2025-03-08 05:30:57,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:57,981 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 681 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:57,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 3061 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2025-03-08 05:30:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1704. [2025-03-08 05:30:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1335 states have (on average 1.5760299625468164) internal successors, (2104), 1382 states have internal predecessors, (2104), 283 states have call successors, (283), 81 states have call predecessors, (283), 85 states have return successors, (289), 281 states have call predecessors, (289), 281 states have call successors, (289) [2025-03-08 05:30:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2676 transitions. [2025-03-08 05:30:58,053 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2676 transitions. Word has length 170 [2025-03-08 05:30:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:58,054 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2676 transitions. [2025-03-08 05:30:58,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:30:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2676 transitions. [2025-03-08 05:30:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:30:58,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:58,060 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:58,068 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-08 05:30:58,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:58,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:58,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash 183414329, now seen corresponding path program 1 times [2025-03-08 05:30:58,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:58,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392959793] [2025-03-08 05:30:58,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:58,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:58,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:30:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:30:58,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:58,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392959793] [2025-03-08 05:30:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392959793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:58,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:58,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448537827] [2025-03-08 05:30:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:58,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:58,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:58,323 INFO L87 Difference]: Start difference. First operand 1704 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:58,393 INFO L93 Difference]: Finished difference Result 3754 states and 5962 transitions. [2025-03-08 05:30:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:58,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 176 [2025-03-08 05:30:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:58,404 INFO L225 Difference]: With dead ends: 3754 [2025-03-08 05:30:58,404 INFO L226 Difference]: Without dead ends: 2165 [2025-03-08 05:30:58,408 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-08 05:30:58,408 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 173 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1710 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-08 05:30:58,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1710 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-03-08 05:30:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2149. [2025-03-08 05:30:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1710 states have (on average 1.5900584795321637) internal successors, (2719), 1767 states have internal predecessors, (2719), 353 states have call successors, (353), 81 states have call predecessors, (353), 85 states have return successors, (359), 351 states have call predecessors, (359), 351 states have call successors, (359) [2025-03-08 05:30:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3431 transitions. [2025-03-08 05:30:58,488 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3431 transitions. Word has length 176 [2025-03-08 05:30:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:58,489 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3431 transitions. [2025-03-08 05:30:58,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3431 transitions. [2025-03-08 05:30:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:30:58,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:58,498 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:58,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:30:58,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash 514430062, now seen corresponding path program 1 times [2025-03-08 05:30:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:58,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052795522] [2025-03-08 05:30:58,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:58,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:58,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:30:58,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:30:58,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:58,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052795522] [2025-03-08 05:30:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052795522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:58,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:58,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633285412] [2025-03-08 05:30:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:58,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:58,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:58,574 INFO L87 Difference]: Start difference. First operand 2149 states and 3431 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:58,648 INFO L93 Difference]: Finished difference Result 4917 states and 7958 transitions. [2025-03-08 05:30:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:58,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-03-08 05:30:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:58,664 INFO L225 Difference]: With dead ends: 4917 [2025-03-08 05:30:58,665 INFO L226 Difference]: Without dead ends: 3108 [2025-03-08 05:30:58,671 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-08 05:30:58,672 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 171 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1749 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-08 05:30:58,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1749 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2025-03-08 05:30:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3092. [2025-03-08 05:30:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 2498 states have (on average 1.6140912730184147) internal successors, (4032), 2575 states have internal predecessors, (4032), 508 states have call successors, (508), 81 states have call predecessors, (508), 85 states have return successors, (514), 506 states have call predecessors, (514), 506 states have call successors, (514) [2025-03-08 05:30:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 5054 transitions. [2025-03-08 05:30:58,780 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 5054 transitions. Word has length 177 [2025-03-08 05:30:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 3092 states and 5054 transitions. [2025-03-08 05:30:58,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 5054 transitions. [2025-03-08 05:30:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 05:30:58,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:58,794 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:58,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:30:58,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -964417000, now seen corresponding path program 1 times [2025-03-08 05:30:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:58,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178195518] [2025-03-08 05:30:58,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:58,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:30:58,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:30:58,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:58,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178195518] [2025-03-08 05:30:58,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178195518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:58,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:58,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337436173] [2025-03-08 05:30:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:58,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:58,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:58,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:58,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:58,873 INFO L87 Difference]: Start difference. First operand 3092 states and 5054 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:59,006 INFO L93 Difference]: Finished difference Result 7320 states and 12095 transitions. [2025-03-08 05:30:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-03-08 05:30:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:59,028 INFO L225 Difference]: With dead ends: 7320 [2025-03-08 05:30:59,029 INFO L226 Difference]: Without dead ends: 4497 [2025-03-08 05:30:59,036 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-08 05:30:59,037 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 169 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1748 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-08 05:30:59,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1748 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2025-03-08 05:30:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 4481. [2025-03-08 05:30:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4481 states, 3678 states have (on average 1.6283306144643828) internal successors, (5989), 3783 states have internal predecessors, (5989), 717 states have call successors, (717), 81 states have call predecessors, (717), 85 states have return successors, (723), 715 states have call predecessors, (723), 715 states have call successors, (723) [2025-03-08 05:30:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 7429 transitions. [2025-03-08 05:30:59,190 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 7429 transitions. Word has length 178 [2025-03-08 05:30:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:59,190 INFO L471 AbstractCegarLoop]: Abstraction has 4481 states and 7429 transitions. [2025-03-08 05:30:59,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 7429 transitions. [2025-03-08 05:30:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:30:59,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:59,208 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:30:59,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -594515729, now seen corresponding path program 1 times [2025-03-08 05:30:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835747985] [2025-03-08 05:30:59,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:59,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:30:59,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:30:59,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:59,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:59,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835747985] [2025-03-08 05:30:59,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835747985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:59,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:59,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175055472] [2025-03-08 05:30:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:59,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:59,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:59,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:59,273 INFO L87 Difference]: Start difference. First operand 4481 states and 7429 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:59,405 INFO L93 Difference]: Finished difference Result 10569 states and 17677 transitions. [2025-03-08 05:30:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2025-03-08 05:30:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:59,439 INFO L225 Difference]: With dead ends: 10569 [2025-03-08 05:30:59,439 INFO L226 Difference]: Without dead ends: 6640 [2025-03-08 05:30:59,453 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-08 05:30:59,454 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 167 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1738 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-08 05:30:59,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1738 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2025-03-08 05:30:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6624. [2025-03-08 05:30:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 5535 states have (on average 1.6401084010840108) internal successors, (9078), 5686 states have internal predecessors, (9078), 1003 states have call successors, (1003), 81 states have call predecessors, (1003), 85 states have return successors, (1009), 1001 states have call predecessors, (1009), 1001 states have call successors, (1009) [2025-03-08 05:30:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 11090 transitions. [2025-03-08 05:30:59,703 INFO L78 Accepts]: Start accepts. Automaton has 6624 states and 11090 transitions. Word has length 179 [2025-03-08 05:30:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:59,704 INFO L471 AbstractCegarLoop]: Abstraction has 6624 states and 11090 transitions. [2025-03-08 05:30:59,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:30:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6624 states and 11090 transitions. [2025-03-08 05:30:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 05:30:59,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:59,730 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:30:59,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:30:59,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash -47509321, now seen corresponding path program 1 times [2025-03-08 05:30:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786152811] [2025-03-08 05:30:59,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:59,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 05:30:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 05:30:59,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:59,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:30:59,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786152811] [2025-03-08 05:30:59,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786152811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:59,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:59,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302633271] [2025-03-08 05:30:59,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:59,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:59,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:59,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:59,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:59,801 INFO L87 Difference]: Start difference. First operand 6624 states and 11090 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:00,018 INFO L93 Difference]: Finished difference Result 15829 states and 26722 transitions. [2025-03-08 05:31:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 180 [2025-03-08 05:31:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:00,062 INFO L225 Difference]: With dead ends: 15829 [2025-03-08 05:31:00,062 INFO L226 Difference]: Without dead ends: 10173 [2025-03-08 05:31:00,078 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-08 05:31:00,078 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 165 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1742 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-08 05:31:00,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1742 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10173 states. [2025-03-08 05:31:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10173 to 10157. [2025-03-08 05:31:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10157 states, 8627 states have (on average 1.6499362466674394) internal successors, (14234), 8858 states have internal predecessors, (14234), 1444 states have call successors, (1444), 81 states have call predecessors, (1444), 85 states have return successors, (1450), 1442 states have call predecessors, (1450), 1442 states have call successors, (1450) [2025-03-08 05:31:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10157 states to 10157 states and 17128 transitions. [2025-03-08 05:31:00,469 INFO L78 Accepts]: Start accepts. Automaton has 10157 states and 17128 transitions. Word has length 180 [2025-03-08 05:31:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:00,469 INFO L471 AbstractCegarLoop]: Abstraction has 10157 states and 17128 transitions. [2025-03-08 05:31:00,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10157 states and 17128 transitions. [2025-03-08 05:31:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 05:31:00,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:00,510 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:00,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:31:00,511 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:00,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash -422121840, now seen corresponding path program 1 times [2025-03-08 05:31:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:00,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36487186] [2025-03-08 05:31:00,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:00,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 05:31:00,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 05:31:00,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:00,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:31:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36487186] [2025-03-08 05:31:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36487186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880486310] [2025-03-08 05:31:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:00,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:00,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:00,588 INFO L87 Difference]: Start difference. First operand 10157 states and 17128 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:00,948 INFO L93 Difference]: Finished difference Result 24849 states and 42248 transitions. [2025-03-08 05:31:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:00,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 181 [2025-03-08 05:31:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:01,012 INFO L225 Difference]: With dead ends: 24849 [2025-03-08 05:31:01,012 INFO L226 Difference]: Without dead ends: 16249 [2025-03-08 05:31:01,047 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-08 05:31:01,048 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 163 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1741 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-08 05:31:01,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1741 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states. [2025-03-08 05:31:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16249 to 16233. [2025-03-08 05:31:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16233 states, 13792 states have (on average 1.6537848027842228) internal successors, (22809), 14169 states have internal predecessors, (22809), 2355 states have call successors, (2355), 81 states have call predecessors, (2355), 85 states have return successors, (2361), 2353 states have call predecessors, (2361), 2353 states have call successors, (2361) [2025-03-08 05:31:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16233 states to 16233 states and 27525 transitions. [2025-03-08 05:31:01,601 INFO L78 Accepts]: Start accepts. Automaton has 16233 states and 27525 transitions. Word has length 181 [2025-03-08 05:31:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:01,602 INFO L471 AbstractCegarLoop]: Abstraction has 16233 states and 27525 transitions. [2025-03-08 05:31:01,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16233 states and 27525 transitions. [2025-03-08 05:31:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:31:01,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:01,656 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:01,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:31:01,656 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:01,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:01,657 INFO L85 PathProgramCache]: Analyzing trace with hash -693894506, now seen corresponding path program 1 times [2025-03-08 05:31:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:01,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735351077] [2025-03-08 05:31:01,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:01,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:31:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:31:01,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:01,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:31:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735351077] [2025-03-08 05:31:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735351077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:01,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:01,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64030152] [2025-03-08 05:31:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:01,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:01,723 INFO L87 Difference]: Start difference. First operand 16233 states and 27525 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:02,126 INFO L93 Difference]: Finished difference Result 41447 states and 70812 transitions. [2025-03-08 05:31:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 182 [2025-03-08 05:31:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:02,233 INFO L225 Difference]: With dead ends: 41447 [2025-03-08 05:31:02,233 INFO L226 Difference]: Without dead ends: 27459 [2025-03-08 05:31:02,277 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-08 05:31:02,278 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 161 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1754 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-08 05:31:02,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1754 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27459 states. [2025-03-08 05:31:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27459 to 27443. [2025-03-08 05:31:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27443 states, 23444 states have (on average 1.6584627196724109) internal successors, (38881), 24097 states have internal predecessors, (38881), 3913 states have call successors, (3913), 81 states have call predecessors, (3913), 85 states have return successors, (3919), 3911 states have call predecessors, (3919), 3911 states have call successors, (3919) [2025-03-08 05:31:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27443 states to 27443 states and 46713 transitions. [2025-03-08 05:31:03,317 INFO L78 Accepts]: Start accepts. Automaton has 27443 states and 46713 transitions. Word has length 182 [2025-03-08 05:31:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:03,317 INFO L471 AbstractCegarLoop]: Abstraction has 27443 states and 46713 transitions. [2025-03-08 05:31:03,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27443 states and 46713 transitions. [2025-03-08 05:31:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:31:03,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:03,415 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:03,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:31:03,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:03,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:03,417 INFO L85 PathProgramCache]: Analyzing trace with hash -931263215, now seen corresponding path program 1 times [2025-03-08 05:31:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:03,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555272970] [2025-03-08 05:31:03,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:03,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:31:03,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:31:03,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:03,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:31:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555272970] [2025-03-08 05:31:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555272970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107975320] [2025-03-08 05:31:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:03,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:03,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:03,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:03,507 INFO L87 Difference]: Start difference. First operand 27443 states and 46713 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:04,455 INFO L93 Difference]: Finished difference Result 67608 states and 115048 transitions. [2025-03-08 05:31:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:04,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2025-03-08 05:31:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:04,601 INFO L225 Difference]: With dead ends: 67608 [2025-03-08 05:31:04,602 INFO L226 Difference]: Without dead ends: 43988 [2025-03-08 05:31:04,645 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-08 05:31:04,646 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 159 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1725 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-08 05:31:04,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1725 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43988 states. [2025-03-08 05:31:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43988 to 43972. [2025-03-08 05:31:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43972 states, 37654 states have (on average 1.6425877728793754) internal successors, (61850), 38841 states have internal predecessors, (61850), 6232 states have call successors, (6232), 81 states have call predecessors, (6232), 85 states have return successors, (6238), 6230 states have call predecessors, (6238), 6230 states have call successors, (6238) [2025-03-08 05:31:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43972 states to 43972 states and 74320 transitions. [2025-03-08 05:31:05,863 INFO L78 Accepts]: Start accepts. Automaton has 43972 states and 74320 transitions. Word has length 183 [2025-03-08 05:31:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:05,864 INFO L471 AbstractCegarLoop]: Abstraction has 43972 states and 74320 transitions. [2025-03-08 05:31:05,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 43972 states and 74320 transitions. [2025-03-08 05:31:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 05:31:06,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:06,189 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:06,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:31:06,189 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1489372491, now seen corresponding path program 1 times [2025-03-08 05:31:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:06,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717420254] [2025-03-08 05:31:06,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:06,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:31:06,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:31:06,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:06,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:31:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717420254] [2025-03-08 05:31:06,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717420254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:06,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:06,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:06,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849994464] [2025-03-08 05:31:06,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:06,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:06,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:06,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:06,264 INFO L87 Difference]: Start difference. First operand 43972 states and 74320 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:07,986 INFO L93 Difference]: Finished difference Result 118737 states and 201224 transitions. [2025-03-08 05:31:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2025-03-08 05:31:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:08,327 INFO L225 Difference]: With dead ends: 118737 [2025-03-08 05:31:08,327 INFO L226 Difference]: Without dead ends: 79625 [2025-03-08 05:31:08,455 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-08 05:31:08,457 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 157 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1750 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-08 05:31:08,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1750 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79625 states. [2025-03-08 05:31:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79625 to 79609. [2025-03-08 05:31:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79609 states, 68505 states have (on average 1.6384205532442888) internal successors, (112240), 70216 states have internal predecessors, (112240), 11018 states have call successors, (11018), 81 states have call predecessors, (11018), 85 states have return successors, (11024), 11016 states have call predecessors, (11024), 11016 states have call successors, (11024) [2025-03-08 05:31:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79609 states to 79609 states and 134282 transitions. [2025-03-08 05:31:11,137 INFO L78 Accepts]: Start accepts. Automaton has 79609 states and 134282 transitions. Word has length 184 [2025-03-08 05:31:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 79609 states and 134282 transitions. [2025-03-08 05:31:11,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 79609 states and 134282 transitions. [2025-03-08 05:31:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:31:11,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:11,371 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:11,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:31:11,371 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:11,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1987969207, now seen corresponding path program 1 times [2025-03-08 05:31:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141406033] [2025-03-08 05:31:11,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:11,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:31:11,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:31:11,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:11,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:31:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141406033] [2025-03-08 05:31:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141406033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:31:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059189602] [2025-03-08 05:31:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:11,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:31:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:11,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:31:11,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:11,814 INFO L87 Difference]: Start difference. First operand 79609 states and 134282 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:13,645 INFO L93 Difference]: Finished difference Result 152550 states and 257628 transitions. [2025-03-08 05:31:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:31:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 185 [2025-03-08 05:31:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:14,186 INFO L225 Difference]: With dead ends: 152550 [2025-03-08 05:31:14,187 INFO L226 Difference]: Without dead ends: 79625 [2025-03-08 05:31:14,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 05:31:14,317 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 128 mSDsluCounter, 3933 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:14,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 4952 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79625 states. [2025-03-08 05:31:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79625 to 79609. [2025-03-08 05:31:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79609 states, 68505 states have (on average 1.6307860740091964) internal successors, (111717), 70216 states have internal predecessors, (111717), 11018 states have call successors, (11018), 81 states have call predecessors, (11018), 85 states have return successors, (11024), 11016 states have call predecessors, (11024), 11016 states have call successors, (11024) [2025-03-08 05:31:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79609 states to 79609 states and 133759 transitions. [2025-03-08 05:31:16,596 INFO L78 Accepts]: Start accepts. Automaton has 79609 states and 133759 transitions. Word has length 185 [2025-03-08 05:31:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:16,597 INFO L471 AbstractCegarLoop]: Abstraction has 79609 states and 133759 transitions. [2025-03-08 05:31:16,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 79609 states and 133759 transitions. [2025-03-08 05:31:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:31:16,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:16,838 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:16,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:31:16,838 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:16,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash -205976878, now seen corresponding path program 1 times [2025-03-08 05:31:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526073988] [2025-03-08 05:31:16,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:16,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:31:16,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:31:16,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:16,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:31:16,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526073988] [2025-03-08 05:31:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526073988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:16,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:16,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:16,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44285713] [2025-03-08 05:31:16,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:16,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:16,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:16,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:16,917 INFO L87 Difference]: Start difference. First operand 79609 states and 133759 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:19,675 INFO L93 Difference]: Finished difference Result 219884 states and 370670 transitions. [2025-03-08 05:31:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:19,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 185 [2025-03-08 05:31:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:20,196 INFO L225 Difference]: With dead ends: 219884 [2025-03-08 05:31:20,197 INFO L226 Difference]: Without dead ends: 146604 [2025-03-08 05:31:20,363 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-08 05:31:20,364 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 155 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1745 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-08 05:31:20,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1745 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146604 states. [2025-03-08 05:31:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146604 to 146588. [2025-03-08 05:31:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146588 states, 126587 states have (on average 1.6294406218648045) internal successors, (206266), 129859 states have internal predecessors, (206266), 19915 states have call successors, (19915), 81 states have call predecessors, (19915), 85 states have return successors, (19921), 19913 states have call predecessors, (19921), 19913 states have call successors, (19921) [2025-03-08 05:31:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146588 states to 146588 states and 246102 transitions. [2025-03-08 05:31:24,642 INFO L78 Accepts]: Start accepts. Automaton has 146588 states and 246102 transitions. Word has length 185 [2025-03-08 05:31:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:24,642 INFO L471 AbstractCegarLoop]: Abstraction has 146588 states and 246102 transitions. [2025-03-08 05:31:24,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:31:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 146588 states and 246102 transitions. [2025-03-08 05:31:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 05:31:24,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:24,921 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:24,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:31:24,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2118698868, now seen corresponding path program 1 times [2025-03-08 05:31:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32916352] [2025-03-08 05:31:24,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:24,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 05:31:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 05:31:24,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:24,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:31:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:24,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32916352] [2025-03-08 05:31:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32916352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:24,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438609111] [2025-03-08 05:31:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:24,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:24,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:24,982 INFO L87 Difference]: Start difference. First operand 146588 states and 246102 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)