./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18d9c4eb49bcfbad00b16e4c52915ece2e20abb9b599480aaed1e3c1557875b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:53:46,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:53:46,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:53:46,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:53:46,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:53:46,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:53:46,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:53:46,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:53:46,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:53:46,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:53:46,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:53:46,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:53:46,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:53:46,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:46,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:46,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:53:46,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:53:46,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18d9c4eb49bcfbad00b16e4c52915ece2e20abb9b599480aaed1e3c1557875b0 [2025-01-09 03:53:46,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:53:46,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:53:46,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:53:46,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:53:46,780 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:53:46,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c [2025-01-09 03:53:47,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7269e6e1b/0e3d3d6eb9a547c5b10904fa890f5b98/FLAGdf4834f76 [2025-01-09 03:53:48,235 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:53:48,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c [2025-01-09 03:53:48,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7269e6e1b/0e3d3d6eb9a547c5b10904fa890f5b98/FLAGdf4834f76 [2025-01-09 03:53:48,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7269e6e1b/0e3d3d6eb9a547c5b10904fa890f5b98 [2025-01-09 03:53:48,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:53:48,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:53:48,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:53:48,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:53:48,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:53:48,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:53:48" (1/1) ... [2025-01-09 03:53:48,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eb93b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:48, skipping insertion in model container [2025-01-09 03:53:48,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:53:48" (1/1) ... [2025-01-09 03:53:48,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:53:48,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c[9250,9263] [2025-01-09 03:53:48,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:53:48,946 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:53:48,952 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-01-09 03:53:48,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [276] [2025-01-09 03:53:48,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [386] [2025-01-09 03:53:48,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [403] [2025-01-09 03:53:48,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [412] [2025-01-09 03:53:48,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [778] [2025-01-09 03:53:48,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1356] [2025-01-09 03:53:48,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1753] [2025-01-09 03:53:48,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2030] [2025-01-09 03:53:48,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3101] [2025-01-09 03:53:48,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [3450] [2025-01-09 03:53:48,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c[9250,9263] [2025-01-09 03:53:49,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:53:49,088 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:53:49,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49 WrapperNode [2025-01-09 03:53:49,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:53:49,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:53:49,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:53:49,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:53:49,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,159 INFO L138 Inliner]: procedures = 152, calls = 270, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1346 [2025-01-09 03:53:49,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:53:49,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:53:49,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:53:49,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:53:49,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,219 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-01-09 03:53:49,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:53:49,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:53:49,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:53:49,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:53:49,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (1/1) ... [2025-01-09 03:53:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:49,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:53:49,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:53:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:53:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:53:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-01-09 03:53:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-01-09 03:53:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-01-09 03:53:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-01-09 03:53:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:53:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:53:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:53:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:53:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-01-09 03:53:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:53:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:53:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:53:49,356 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:53:49,356 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:53:49,356 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:53:49,356 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:53:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-01-09 03:53:49,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-01-09 03:53:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-01-09 03:53:49,358 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-01-09 03:53:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:53:49,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:53:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:53:49,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:53:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:53:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:53:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:53:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:53:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:53:49,359 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:53:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-01-09 03:53:49,360 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-01-09 03:53:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-01-09 03:53:49,360 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-01-09 03:53:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:53:49,360 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:53:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:53:49,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:53:49,529 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:53:49,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:53:50,503 INFO L? ?]: Removed 633 outVars from TransFormulas that were not future-live. [2025-01-09 03:53:50,504 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:53:50,529 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:53:50,534 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:53:50,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:53:50 BoogieIcfgContainer [2025-01-09 03:53:50,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:53:50,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:53:50,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:53:50,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:53:50,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:53:48" (1/3) ... [2025-01-09 03:53:50,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:53:50, skipping insertion in model container [2025-01-09 03:53:50,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:49" (2/3) ... [2025-01-09 03:53:50,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:53:50, skipping insertion in model container [2025-01-09 03:53:50,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:53:50" (3/3) ... [2025-01-09 03:53:50,542 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_productSimulator.cil.c [2025-01-09 03:53:50,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:53:50,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_productSimulator.cil.c that has 45 procedures, 613 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:53:50,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:53:50,657 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;@768dfee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:53:50,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:53:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 613 states, 452 states have (on average 1.511061946902655) internal successors, (683), 474 states have internal predecessors, (683), 115 states have call successors, (115), 44 states have call predecessors, (115), 44 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 03:53:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:53:50,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:50,690 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] [2025-01-09 03:53:50,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:50,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2115681158, now seen corresponding path program 1 times [2025-01-09 03:53:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609276707] [2025-01-09 03:53:50,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:50,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:53:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:53:50,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:50,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:53:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:51,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609276707] [2025-01-09 03:53:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609276707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:51,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:51,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:53:51,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474139227] [2025-01-09 03:53:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:51,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:53:51,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:51,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:53:51,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:53:51,091 INFO L87 Difference]: Start difference. First operand has 613 states, 452 states have (on average 1.511061946902655) internal successors, (683), 474 states have internal predecessors, (683), 115 states have call successors, (115), 44 states have call predecessors, (115), 44 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:53:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:51,157 INFO L93 Difference]: Finished difference Result 957 states and 1409 transitions. [2025-01-09 03:53:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:53:51,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2025-01-09 03:53:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:51,180 INFO L225 Difference]: With dead ends: 957 [2025-01-09 03:53:51,182 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 03:53:51,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:53:51,189 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:51,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 03:53:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-01-09 03:53:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 446 states have (on average 1.5089686098654709) internal successors, (673), 466 states have internal predecessors, (673), 115 states have call successors, (115), 44 states have call predecessors, (115), 43 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:53:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 900 transitions. [2025-01-09 03:53:51,253 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 900 transitions. Word has length 152 [2025-01-09 03:53:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:51,254 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 900 transitions. [2025-01-09 03:53:51,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:53:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 900 transitions. [2025-01-09 03:53:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:53:51,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:51,263 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] [2025-01-09 03:53:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:53:51,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:51,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1000479352, now seen corresponding path program 1 times [2025-01-09 03:53:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:51,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306683331] [2025-01-09 03:53:51,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:51,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:53:51,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:53:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:53:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306683331] [2025-01-09 03:53:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306683331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:51,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852866304] [2025-01-09 03:53:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:51,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:51,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:51,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:51,664 INFO L87 Difference]: Start difference. First operand 605 states and 900 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 03:53:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:51,770 INFO L93 Difference]: Finished difference Result 1174 states and 1744 transitions. [2025-01-09 03:53:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2025-01-09 03:53:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:51,776 INFO L225 Difference]: With dead ends: 1174 [2025-01-09 03:53:51,776 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 03:53:51,779 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-01-09 03:53:51,780 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 0 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:51,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3580 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 03:53:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-01-09 03:53:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 446 states have (on average 1.493273542600897) internal successors, (666), 466 states have internal predecessors, (666), 115 states have call successors, (115), 44 states have call predecessors, (115), 43 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:53:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 893 transitions. [2025-01-09 03:53:51,815 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 893 transitions. Word has length 159 [2025-01-09 03:53:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:51,815 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 893 transitions. [2025-01-09 03:53:51,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 03:53:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 893 transitions. [2025-01-09 03:53:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 03:53:51,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:51,822 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:51,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:53:51,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:51,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash -579192559, now seen corresponding path program 1 times [2025-01-09 03:53:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875468365] [2025-01-09 03:53:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 03:53:51,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 03:53:51,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:51,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-01-09 03:53:52,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:52,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875468365] [2025-01-09 03:53:52,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875468365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:52,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:52,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538454933] [2025-01-09 03:53:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:52,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:52,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:52,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:52,083 INFO L87 Difference]: Start difference. First operand 605 states and 893 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 03:53:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:52,153 INFO L93 Difference]: Finished difference Result 1180 states and 1757 transitions. [2025-01-09 03:53:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:52,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 185 [2025-01-09 03:53:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:52,161 INFO L225 Difference]: With dead ends: 1180 [2025-01-09 03:53:52,162 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 03:53:52,164 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-01-09 03:53:52,165 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 857 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:52,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 900 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 03:53:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2025-01-09 03:53:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 448 states have (on average 1.4821428571428572) internal successors, (664), 466 states have internal predecessors, (664), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 03:53:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 887 transitions. [2025-01-09 03:53:52,214 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 887 transitions. Word has length 185 [2025-01-09 03:53:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:52,214 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 887 transitions. [2025-01-09 03:53:52,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 03:53:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 887 transitions. [2025-01-09 03:53:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 03:53:52,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:52,218 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:52,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:53:52,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:52,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 207249112, now seen corresponding path program 1 times [2025-01-09 03:53:52,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488590595] [2025-01-09 03:53:52,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:52,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 03:53:52,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 03:53:52,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:52,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 03:53:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488590595] [2025-01-09 03:53:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488590595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517143375] [2025-01-09 03:53:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:52,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:52,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:52,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:52,382 INFO L87 Difference]: Start difference. First operand 606 states and 887 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 03:53:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:52,430 INFO L93 Difference]: Finished difference Result 1174 states and 1736 transitions. [2025-01-09 03:53:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-01-09 03:53:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:52,434 INFO L225 Difference]: With dead ends: 1174 [2025-01-09 03:53:52,438 INFO L226 Difference]: Without dead ends: 604 [2025-01-09 03:53:52,440 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-01-09 03:53:52,442 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 837 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:52,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 913 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-01-09 03:53:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-01-09 03:53:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 448 states have (on average 1.4754464285714286) internal successors, (661), 464 states have internal predecessors, (661), 111 states have call successors, (111), 45 states have call predecessors, (111), 44 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 03:53:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 880 transitions. [2025-01-09 03:53:52,476 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 880 transitions. Word has length 195 [2025-01-09 03:53:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:52,477 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 880 transitions. [2025-01-09 03:53:52,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 03:53:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 880 transitions. [2025-01-09 03:53:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:53:52,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:52,482 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, 1, 1] [2025-01-09 03:53:52,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:53:52,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:52,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:52,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1001784568, now seen corresponding path program 1 times [2025-01-09 03:53:52,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:52,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935085854] [2025-01-09 03:53:52,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:52,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:53:52,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:53:52,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:52,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:53:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935085854] [2025-01-09 03:53:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935085854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565140318] [2025-01-09 03:53:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:52,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:52,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:52,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:52,627 INFO L87 Difference]: Start difference. First operand 604 states and 880 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 03:53:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:52,724 INFO L93 Difference]: Finished difference Result 1165 states and 1702 transitions. [2025-01-09 03:53:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 168 [2025-01-09 03:53:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:52,728 INFO L225 Difference]: With dead ends: 1165 [2025-01-09 03:53:52,728 INFO L226 Difference]: Without dead ends: 607 [2025-01-09 03:53:52,730 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-01-09 03:53:52,732 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 817 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:52,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 896 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-09 03:53:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 601. [2025-01-09 03:53:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 448 states have (on average 1.4508928571428572) internal successors, (650), 459 states have internal predecessors, (650), 108 states have call successors, (108), 45 states have call predecessors, (108), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:53:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 863 transitions. [2025-01-09 03:53:52,768 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 863 transitions. Word has length 168 [2025-01-09 03:53:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:52,769 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 863 transitions. [2025-01-09 03:53:52,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 03:53:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 863 transitions. [2025-01-09 03:53:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 03:53:52,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:52,772 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:52,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:53:52,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash -913043513, now seen corresponding path program 1 times [2025-01-09 03:53:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:52,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41629165] [2025-01-09 03:53:52,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:52,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 03:53:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 03:53:52,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:52,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 03:53:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41629165] [2025-01-09 03:53:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41629165] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259293915] [2025-01-09 03:53:53,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:53,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:53,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:53,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:53,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:53:53,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 03:53:53,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 03:53:53,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:53,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:53,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:53:53,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:53:53,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259293915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:53,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:53:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566432732] [2025-01-09 03:53:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:53,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:53,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:53,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:53,517 INFO L87 Difference]: Start difference. First operand 601 states and 863 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:53:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:53,562 INFO L93 Difference]: Finished difference Result 937 states and 1327 transitions. [2025-01-09 03:53:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 186 [2025-01-09 03:53:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:53,566 INFO L225 Difference]: With dead ends: 937 [2025-01-09 03:53:53,566 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 03:53:53,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:53,568 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 1 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:53,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1716 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 03:53:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 602. [2025-01-09 03:53:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 449 states have (on average 1.4498886414253898) internal successors, (651), 460 states have internal predecessors, (651), 108 states have call successors, (108), 45 states have call predecessors, (108), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:53:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 864 transitions. [2025-01-09 03:53:53,607 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 864 transitions. Word has length 186 [2025-01-09 03:53:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:53,608 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 864 transitions. [2025-01-09 03:53:53,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:53:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 864 transitions. [2025-01-09 03:53:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 03:53:53,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:53,611 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:53,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:53:53,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:53,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:53,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 628389418, now seen corresponding path program 1 times [2025-01-09 03:53:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:53,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855427283] [2025-01-09 03:53:53,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:53,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 03:53:53,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 03:53:53,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:53,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:53:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:54,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855427283] [2025-01-09 03:53:54,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855427283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:54,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801434699] [2025-01-09 03:53:54,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:54,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:54,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:54,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:54,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:53:54,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 03:53:54,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 03:53:54,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:54,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:54,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:54,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:53:54,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801434699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:54,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:53:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683627331] [2025-01-09 03:53:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:54,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:54,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:54,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:54,534 INFO L87 Difference]: Start difference. First operand 602 states and 864 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:53:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:54,572 INFO L93 Difference]: Finished difference Result 1224 states and 1789 transitions. [2025-01-09 03:53:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:54,573 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 193 [2025-01-09 03:53:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:54,576 INFO L225 Difference]: With dead ends: 1224 [2025-01-09 03:53:54,576 INFO L226 Difference]: Without dead ends: 699 [2025-01-09 03:53:54,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:54,579 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 165 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1693 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-01-09 03:53:54,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1693 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-09 03:53:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 691. [2025-01-09 03:53:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 524 states have (on average 1.465648854961832) internal successors, (768), 535 states have internal predecessors, (768), 122 states have call successors, (122), 45 states have call predecessors, (122), 44 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 03:53:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1009 transitions. [2025-01-09 03:53:54,606 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1009 transitions. Word has length 193 [2025-01-09 03:53:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:54,606 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1009 transitions. [2025-01-09 03:53:54,606 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:53:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1009 transitions. [2025-01-09 03:53:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 03:53:54,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:54,609 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:54,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:53:54,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:54,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:54,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1708392383, now seen corresponding path program 1 times [2025-01-09 03:53:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047890484] [2025-01-09 03:53:54,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:54,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 03:53:54,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 03:53:54,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:54,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 03:53:55,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:55,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047890484] [2025-01-09 03:53:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047890484] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:55,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104703506] [2025-01-09 03:53:55,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:55,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:55,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:55,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:55,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:53:55,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 03:53:55,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 03:53:55,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:55,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:55,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1649 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:55,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:53:55,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104703506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:55,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:55,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:53:55,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325427771] [2025-01-09 03:53:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:55,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:55,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:55,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:55,541 INFO L87 Difference]: Start difference. First operand 691 states and 1009 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 03:53:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:55,622 INFO L93 Difference]: Finished difference Result 1998 states and 2968 transitions. [2025-01-09 03:53:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 222 [2025-01-09 03:53:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:55,631 INFO L225 Difference]: With dead ends: 1998 [2025-01-09 03:53:55,631 INFO L226 Difference]: Without dead ends: 1336 [2025-01-09 03:53:55,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:55,633 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 724 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:55,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1730 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-01-09 03:53:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1332. [2025-01-09 03:53:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1021 states have (on average 1.4701273261508325) internal successors, (1501), 1037 states have internal predecessors, (1501), 223 states have call successors, (223), 88 states have call predecessors, (223), 87 states have return successors, (235), 219 states have call predecessors, (235), 219 states have call successors, (235) [2025-01-09 03:53:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1959 transitions. [2025-01-09 03:53:55,712 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1959 transitions. Word has length 222 [2025-01-09 03:53:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:55,714 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1959 transitions. [2025-01-09 03:53:55,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 03:53:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1959 transitions. [2025-01-09 03:53:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 03:53:55,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:55,718 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:55,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:55,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:55,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:55,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1707393632, now seen corresponding path program 1 times [2025-01-09 03:53:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496964872] [2025-01-09 03:53:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:55,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 03:53:55,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 03:53:55,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:55,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 03:53:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496964872] [2025-01-09 03:53:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496964872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264390112] [2025-01-09 03:53:56,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:56,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:56,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:56,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:53:56,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 03:53:56,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 03:53:56,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:56,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:56,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:56,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 03:53:56,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264390112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:56,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:53:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693788294] [2025-01-09 03:53:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:56,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:56,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:56,680 INFO L87 Difference]: Start difference. First operand 1332 states and 1959 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:53:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:56,806 INFO L93 Difference]: Finished difference Result 3216 states and 4739 transitions. [2025-01-09 03:53:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:56,807 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), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 201 [2025-01-09 03:53:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:56,821 INFO L225 Difference]: With dead ends: 3216 [2025-01-09 03:53:56,821 INFO L226 Difference]: Without dead ends: 2587 [2025-01-09 03:53:56,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:56,828 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 723 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:56,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1691 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-01-09 03:53:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2583. [2025-01-09 03:53:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 1993 states have (on average 1.4746613146011038) internal successors, (2939), 2018 states have internal predecessors, (2939), 420 states have call successors, (420), 170 states have call predecessors, (420), 169 states have return successors, (468), 414 states have call predecessors, (468), 414 states have call successors, (468) [2025-01-09 03:53:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3827 transitions. [2025-01-09 03:53:57,000 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3827 transitions. Word has length 201 [2025-01-09 03:53:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:57,000 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 3827 transitions. [2025-01-09 03:53:57,001 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), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:53:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3827 transitions. [2025-01-09 03:53:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 03:53:57,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:57,008 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:57,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:53:57,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 03:53:57,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:57,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 554245421, now seen corresponding path program 1 times [2025-01-09 03:53:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171413895] [2025-01-09 03:53:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:57,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 03:53:57,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 03:53:57,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:57,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:53:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171413895] [2025-01-09 03:53:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171413895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:57,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486874657] [2025-01-09 03:53:57,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:57,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:57,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:57,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:57,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:53:57,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 03:53:57,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 03:53:57,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:57,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:57,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 03:53:57,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:53:57,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486874657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:57,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:53:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023274221] [2025-01-09 03:53:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:57,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:57,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:53:57,817 INFO L87 Difference]: Start difference. First operand 2583 states and 3827 transitions. Second operand has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:53:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:58,001 INFO L93 Difference]: Finished difference Result 5043 states and 7518 transitions. [2025-01-09 03:53:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:53:58,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 194 [2025-01-09 03:53:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:58,018 INFO L225 Difference]: With dead ends: 5043 [2025-01-09 03:53:58,018 INFO L226 Difference]: Without dead ends: 2591 [2025-01-09 03:53:58,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:53:58,027 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 4 mSDsluCounter, 5083 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5933 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:58,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5933 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-01-09 03:53:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2591. [2025-01-09 03:53:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 1997 states have (on average 1.4737105658487732) internal successors, (2943), 2026 states have internal predecessors, (2943), 420 states have call successors, (420), 170 states have call predecessors, (420), 173 states have return successors, (476), 414 states have call predecessors, (476), 414 states have call successors, (476) [2025-01-09 03:53:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3839 transitions. [2025-01-09 03:53:58,143 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3839 transitions. Word has length 194 [2025-01-09 03:53:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:58,145 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 3839 transitions. [2025-01-09 03:53:58,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:53:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3839 transitions. [2025-01-09 03:53:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 03:53:58,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:58,155 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:58,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:53:58,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:53:58,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:58,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1906448076, now seen corresponding path program 1 times [2025-01-09 03:53:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55780494] [2025-01-09 03:53:58,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:58,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 03:53:58,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 03:53:58,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:58,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:53:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55780494] [2025-01-09 03:53:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55780494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418850149] [2025-01-09 03:53:58,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:58,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:58,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:58,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:53:58,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 03:53:58,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 03:53:58,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:58,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:58,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:53:58,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:53:58,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:58,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418850149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 03:53:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605596565] [2025-01-09 03:53:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:58,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:53:58,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:58,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:53:58,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:53:58,906 INFO L87 Difference]: Start difference. First operand 2591 states and 3839 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 03:53:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:59,018 INFO L93 Difference]: Finished difference Result 5047 states and 7534 transitions. [2025-01-09 03:53:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:53:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 195 [2025-01-09 03:53:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:59,033 INFO L225 Difference]: With dead ends: 5047 [2025-01-09 03:53:59,033 INFO L226 Difference]: Without dead ends: 2599 [2025-01-09 03:53:59,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:53:59,042 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 2 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:59,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2025-01-09 03:53:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2599. [2025-01-09 03:53:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2001 states have (on average 1.4727636181909045) internal successors, (2947), 2034 states have internal predecessors, (2947), 420 states have call successors, (420), 170 states have call predecessors, (420), 177 states have return successors, (496), 414 states have call predecessors, (496), 414 states have call successors, (496) [2025-01-09 03:53:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3863 transitions. [2025-01-09 03:53:59,196 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3863 transitions. Word has length 195 [2025-01-09 03:53:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:59,197 INFO L471 AbstractCegarLoop]: Abstraction has 2599 states and 3863 transitions. [2025-01-09 03:53:59,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 03:53:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3863 transitions. [2025-01-09 03:53:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 03:53:59,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:59,204 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:59,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:59,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:53:59,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:59,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash 61391159, now seen corresponding path program 1 times [2025-01-09 03:53:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297989661] [2025-01-09 03:53:59,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:59,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 03:53:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 03:53:59,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:53:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297989661] [2025-01-09 03:53:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297989661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:59,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:59,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:53:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751615003] [2025-01-09 03:53:59,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:59,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:59,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:59,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:59,611 INFO L87 Difference]: Start difference. First operand 2599 states and 3863 transitions. Second operand has 8 states, 6 states have (on average 19.166666666666668) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:53:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:59,738 INFO L93 Difference]: Finished difference Result 4999 states and 7482 transitions. [2025-01-09 03:53:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:53:59,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.166666666666668) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 196 [2025-01-09 03:53:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:59,751 INFO L225 Difference]: With dead ends: 4999 [2025-01-09 03:53:59,751 INFO L226 Difference]: Without dead ends: 2599 [2025-01-09 03:53:59,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:59,759 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 4 mSDsluCounter, 5089 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5940 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:59,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5940 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2025-01-09 03:53:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2599. [2025-01-09 03:53:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2001 states have (on average 1.4727636181909045) internal successors, (2947), 2034 states have internal predecessors, (2947), 420 states have call successors, (420), 170 states have call predecessors, (420), 177 states have return successors, (492), 414 states have call predecessors, (492), 414 states have call successors, (492) [2025-01-09 03:53:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3859 transitions. [2025-01-09 03:53:59,900 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3859 transitions. Word has length 196 [2025-01-09 03:53:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:59,900 INFO L471 AbstractCegarLoop]: Abstraction has 2599 states and 3859 transitions. [2025-01-09 03:53:59,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.166666666666668) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:53:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3859 transitions. [2025-01-09 03:53:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 03:53:59,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:59,909 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:53:59,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:53:59,909 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:59,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1362508342, now seen corresponding path program 2 times [2025-01-09 03:53:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406851107] [2025-01-09 03:53:59,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:53:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:59,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-01-09 03:53:59,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 03:53:59,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:53:59,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 03:54:00,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:00,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406851107] [2025-01-09 03:54:00,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406851107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:00,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:00,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:54:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483577841] [2025-01-09 03:54:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:00,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:54:00,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:00,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:54:00,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:00,085 INFO L87 Difference]: Start difference. First operand 2599 states and 3859 transitions. Second operand has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 03:54:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:00,206 INFO L93 Difference]: Finished difference Result 4987 states and 7458 transitions. [2025-01-09 03:54:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:54:00,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 197 [2025-01-09 03:54:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:00,223 INFO L225 Difference]: With dead ends: 4987 [2025-01-09 03:54:00,223 INFO L226 Difference]: Without dead ends: 2599 [2025-01-09 03:54:00,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 03:54:00,232 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 2 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:00,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4238 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2025-01-09 03:54:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2599. [2025-01-09 03:54:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2001 states have (on average 1.4727636181909045) internal successors, (2947), 2034 states have internal predecessors, (2947), 420 states have call successors, (420), 170 states have call predecessors, (420), 177 states have return successors, (488), 414 states have call predecessors, (488), 414 states have call successors, (488) [2025-01-09 03:54:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3855 transitions. [2025-01-09 03:54:00,355 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3855 transitions. Word has length 197 [2025-01-09 03:54:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:00,356 INFO L471 AbstractCegarLoop]: Abstraction has 2599 states and 3855 transitions. [2025-01-09 03:54:00,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 03:54:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3855 transitions. [2025-01-09 03:54:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 03:54:00,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:00,362 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:00,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:54:00,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:00,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1397887709, now seen corresponding path program 3 times [2025-01-09 03:54:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:00,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452252861] [2025-01-09 03:54:00,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:54:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:00,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 198 statements into 8 equivalence classes. [2025-01-09 03:54:00,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 151 of 198 statements. [2025-01-09 03:54:00,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:54:00,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 03:54:00,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452252861] [2025-01-09 03:54:00,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452252861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:00,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:00,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:54:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801854145] [2025-01-09 03:54:00,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:00,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:54:00,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:00,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:54:00,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:00,543 INFO L87 Difference]: Start difference. First operand 2599 states and 3855 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:54:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:01,212 INFO L93 Difference]: Finished difference Result 6581 states and 9754 transitions. [2025-01-09 03:54:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:01,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) Word has length 198 [2025-01-09 03:54:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:01,239 INFO L225 Difference]: With dead ends: 6581 [2025-01-09 03:54:01,239 INFO L226 Difference]: Without dead ends: 5369 [2025-01-09 03:54:01,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:54:01,246 INFO L435 NwaCegarLoop]: 1173 mSDtfsCounter, 1352 mSDsluCounter, 3834 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 5007 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:01,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 5007 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:54:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5369 states. [2025-01-09 03:54:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5369 to 5337. [2025-01-09 03:54:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5337 states, 3993 states have (on average 1.4427748559979965) internal successors, (5761), 4088 states have internal predecessors, (5761), 892 states have call successors, (892), 440 states have call predecessors, (892), 451 states have return successors, (1152), 870 states have call predecessors, (1152), 854 states have call successors, (1152) [2025-01-09 03:54:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5337 states to 5337 states and 7805 transitions. [2025-01-09 03:54:01,501 INFO L78 Accepts]: Start accepts. Automaton has 5337 states and 7805 transitions. Word has length 198 [2025-01-09 03:54:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:01,501 INFO L471 AbstractCegarLoop]: Abstraction has 5337 states and 7805 transitions. [2025-01-09 03:54:01,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:54:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5337 states and 7805 transitions. [2025-01-09 03:54:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 03:54:01,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:01,510 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:01,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:54:01,510 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:01,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash 946869929, now seen corresponding path program 1 times [2025-01-09 03:54:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:01,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565482789] [2025-01-09 03:54:01,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:01,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 03:54:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 03:54:01,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:01,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 03:54:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:01,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565482789] [2025-01-09 03:54:01,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565482789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:01,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:01,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538988753] [2025-01-09 03:54:01,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:01,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:01,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:01,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:01,740 INFO L87 Difference]: Start difference. First operand 5337 states and 7805 transitions. Second operand has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:54:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:01,976 INFO L93 Difference]: Finished difference Result 10483 states and 15386 transitions. [2025-01-09 03:54:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:54:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 199 [2025-01-09 03:54:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:02,026 INFO L225 Difference]: With dead ends: 10483 [2025-01-09 03:54:02,027 INFO L226 Difference]: Without dead ends: 5345 [2025-01-09 03:54:02,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:54:02,049 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 3 mSDsluCounter, 5094 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5946 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:02,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5946 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2025-01-09 03:54:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 5345. [2025-01-09 03:54:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5345 states, 3997 states have (on average 1.4423317488116087) internal successors, (5765), 4096 states have internal predecessors, (5765), 892 states have call successors, (892), 440 states have call predecessors, (892), 455 states have return successors, (1160), 870 states have call predecessors, (1160), 854 states have call successors, (1160) [2025-01-09 03:54:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 7817 transitions. [2025-01-09 03:54:02,334 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 7817 transitions. Word has length 199 [2025-01-09 03:54:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 5345 states and 7817 transitions. [2025-01-09 03:54:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:54:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 7817 transitions. [2025-01-09 03:54:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 03:54:02,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:02,354 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:02,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:54:02,355 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:02,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1249686747, now seen corresponding path program 1 times [2025-01-09 03:54:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:02,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530257276] [2025-01-09 03:54:02,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:02,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 03:54:02,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 03:54:02,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:02,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:54:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530257276] [2025-01-09 03:54:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530257276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:02,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:54:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518514355] [2025-01-09 03:54:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:02,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:54:02,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:02,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:54:02,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:54:02,554 INFO L87 Difference]: Start difference. First operand 5345 states and 7817 transitions. Second operand has 9 states, 7 states have (on average 17.428571428571427) internal successors, (122), 8 states have internal predecessors, (122), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:54:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:02,892 INFO L93 Difference]: Finished difference Result 10479 states and 15394 transitions. [2025-01-09 03:54:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:54:02,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 17.428571428571427) internal successors, (122), 8 states have internal predecessors, (122), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 200 [2025-01-09 03:54:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:02,927 INFO L225 Difference]: With dead ends: 10479 [2025-01-09 03:54:02,928 INFO L226 Difference]: Without dead ends: 5353 [2025-01-09 03:54:02,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:02,943 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6738 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:02,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6738 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-01-09 03:54:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 5353. [2025-01-09 03:54:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 4001 states have (on average 1.4418895276180954) internal successors, (5769), 4104 states have internal predecessors, (5769), 892 states have call successors, (892), 440 states have call predecessors, (892), 459 states have return successors, (1180), 870 states have call predecessors, (1180), 854 states have call successors, (1180) [2025-01-09 03:54:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 7841 transitions. [2025-01-09 03:54:03,170 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 7841 transitions. Word has length 200 [2025-01-09 03:54:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:03,171 INFO L471 AbstractCegarLoop]: Abstraction has 5353 states and 7841 transitions. [2025-01-09 03:54:03,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 17.428571428571427) internal successors, (122), 8 states have internal predecessors, (122), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:54:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 7841 transitions. [2025-01-09 03:54:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 03:54:03,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:03,180 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:03,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:54:03,180 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1141672303, now seen corresponding path program 1 times [2025-01-09 03:54:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075329266] [2025-01-09 03:54:03,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:03,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 03:54:03,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 03:54:03,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:03,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075329266] [2025-01-09 03:54:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075329266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464459128] [2025-01-09 03:54:03,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:03,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:03,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:54:03,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 03:54:03,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 03:54:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:03,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:03,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:03,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:54:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:03,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464459128] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:54:03,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:54:03,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:54:03,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60041408] [2025-01-09 03:54:03,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:54:03,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:54:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:03,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:54:03,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:54:03,838 INFO L87 Difference]: Start difference. First operand 5353 states and 7841 transitions. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 03:54:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:04,127 INFO L93 Difference]: Finished difference Result 11707 states and 17431 transitions. [2025-01-09 03:54:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:54:04,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2025-01-09 03:54:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:04,159 INFO L225 Difference]: With dead ends: 11707 [2025-01-09 03:54:04,160 INFO L226 Difference]: Without dead ends: 7725 [2025-01-09 03:54:04,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 399 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-01-09 03:54:04,177 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 603 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 3708 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:04,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 3708 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2025-01-09 03:54:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7485. [2025-01-09 03:54:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7485 states, 5817 states have (on average 1.4854736118274023) internal successors, (8641), 5920 states have internal predecessors, (8641), 1208 states have call successors, (1208), 440 states have call predecessors, (1208), 459 states have return successors, (1536), 1186 states have call predecessors, (1536), 1170 states have call successors, (1536) [2025-01-09 03:54:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7485 states to 7485 states and 11385 transitions. [2025-01-09 03:54:04,603 INFO L78 Accepts]: Start accepts. Automaton has 7485 states and 11385 transitions. Word has length 201 [2025-01-09 03:54:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:04,604 INFO L471 AbstractCegarLoop]: Abstraction has 7485 states and 11385 transitions. [2025-01-09 03:54:04,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 03:54:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 7485 states and 11385 transitions. [2025-01-09 03:54:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 03:54:04,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:04,621 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:04,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:54:04,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:04,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:04,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -518100918, now seen corresponding path program 1 times [2025-01-09 03:54:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380040283] [2025-01-09 03:54:04,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 03:54:04,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 03:54:04,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:04,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:04,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:04,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380040283] [2025-01-09 03:54:04,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380040283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:04,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:04,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968723773] [2025-01-09 03:54:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:04,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:04,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:04,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:04,908 INFO L87 Difference]: Start difference. First operand 7485 states and 11385 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:05,246 INFO L93 Difference]: Finished difference Result 16583 states and 25533 transitions. [2025-01-09 03:54:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 206 [2025-01-09 03:54:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:05,289 INFO L225 Difference]: With dead ends: 16583 [2025-01-09 03:54:05,290 INFO L226 Difference]: Without dead ends: 9541 [2025-01-09 03:54:05,310 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-01-09 03:54:05,311 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 163 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1719 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-01-09 03:54:05,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1719 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9541 states. [2025-01-09 03:54:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9541 to 9461. [2025-01-09 03:54:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9461 states, 7477 states have (on average 1.5028754848201151) internal successors, (11237), 7580 states have internal predecessors, (11237), 1524 states have call successors, (1524), 440 states have call predecessors, (1524), 459 states have return successors, (1892), 1502 states have call predecessors, (1892), 1486 states have call successors, (1892) [2025-01-09 03:54:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 14653 transitions. [2025-01-09 03:54:05,899 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 14653 transitions. Word has length 206 [2025-01-09 03:54:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:05,900 INFO L471 AbstractCegarLoop]: Abstraction has 9461 states and 14653 transitions. [2025-01-09 03:54:05,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 14653 transitions. [2025-01-09 03:54:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 03:54:05,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:05,925 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:05,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:54:05,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:05,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1013569693, now seen corresponding path program 1 times [2025-01-09 03:54:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106734203] [2025-01-09 03:54:05,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:05,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 03:54:05,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 03:54:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106734203] [2025-01-09 03:54:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106734203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:05,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:05,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699365569] [2025-01-09 03:54:05,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:05,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:05,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:05,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:05,989 INFO L87 Difference]: Start difference. First operand 9461 states and 14653 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:06,216 INFO L93 Difference]: Finished difference Result 21503 states and 33629 transitions. [2025-01-09 03:54:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 207 [2025-01-09 03:54:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:06,273 INFO L225 Difference]: With dead ends: 21503 [2025-01-09 03:54:06,273 INFO L226 Difference]: Without dead ends: 12729 [2025-01-09 03:54:06,295 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-01-09 03:54:06,296 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 161 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1714 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-01-09 03:54:06,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1714 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12729 states. [2025-01-09 03:54:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12729 to 12649. [2025-01-09 03:54:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12649 states, 10189 states have (on average 1.5221317106683678) internal successors, (15509), 10292 states have internal predecessors, (15509), 2000 states have call successors, (2000), 440 states have call predecessors, (2000), 459 states have return successors, (2368), 1978 states have call predecessors, (2368), 1962 states have call successors, (2368) [2025-01-09 03:54:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 19877 transitions. [2025-01-09 03:54:06,779 INFO L78 Accepts]: Start accepts. Automaton has 12649 states and 19877 transitions. Word has length 207 [2025-01-09 03:54:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:06,779 INFO L471 AbstractCegarLoop]: Abstraction has 12649 states and 19877 transitions. [2025-01-09 03:54:06,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12649 states and 19877 transitions. [2025-01-09 03:54:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 03:54:06,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:06,807 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:06,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:54:06,807 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:06,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash -238140399, now seen corresponding path program 1 times [2025-01-09 03:54:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:06,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135510409] [2025-01-09 03:54:06,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:06,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:06,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 03:54:06,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 03:54:06,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:06,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:06,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135510409] [2025-01-09 03:54:06,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135510409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:06,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:06,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:06,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320546782] [2025-01-09 03:54:06,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:06,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:06,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:06,869 INFO L87 Difference]: Start difference. First operand 12649 states and 19877 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:07,290 INFO L93 Difference]: Finished difference Result 28987 states and 46009 transitions. [2025-01-09 03:54:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:07,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 208 [2025-01-09 03:54:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:07,368 INFO L225 Difference]: With dead ends: 28987 [2025-01-09 03:54:07,368 INFO L226 Difference]: Without dead ends: 17637 [2025-01-09 03:54:07,390 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-01-09 03:54:07,391 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 159 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1709 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-01-09 03:54:07,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1709 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17637 states. [2025-01-09 03:54:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17637 to 17557. [2025-01-09 03:54:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17557 states, 14449 states have (on average 1.5395529102360024) internal successors, (22245), 14552 states have internal predecessors, (22245), 2648 states have call successors, (2648), 440 states have call predecessors, (2648), 459 states have return successors, (3080), 2626 states have call predecessors, (3080), 2610 states have call successors, (3080) [2025-01-09 03:54:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17557 states to 17557 states and 27973 transitions. [2025-01-09 03:54:07,961 INFO L78 Accepts]: Start accepts. Automaton has 17557 states and 27973 transitions. Word has length 208 [2025-01-09 03:54:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:07,961 INFO L471 AbstractCegarLoop]: Abstraction has 17557 states and 27973 transitions. [2025-01-09 03:54:07,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 17557 states and 27973 transitions. [2025-01-09 03:54:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 03:54:08,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:08,005 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:08,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:54:08,005 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:08,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1847199621, now seen corresponding path program 1 times [2025-01-09 03:54:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823810553] [2025-01-09 03:54:08,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:08,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:08,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 03:54:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 03:54:08,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:08,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823810553] [2025-01-09 03:54:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823810553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:08,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686148420] [2025-01-09 03:54:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:08,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:08,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:08,086 INFO L87 Difference]: Start difference. First operand 17557 states and 27973 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:08,836 INFO L93 Difference]: Finished difference Result 40811 states and 65633 transitions. [2025-01-09 03:54:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:08,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 209 [2025-01-09 03:54:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:09,123 INFO L225 Difference]: With dead ends: 40811 [2025-01-09 03:54:09,126 INFO L226 Difference]: Without dead ends: 25561 [2025-01-09 03:54:09,176 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-01-09 03:54:09,180 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 157 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1709 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-01-09 03:54:09,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1709 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25561 states. [2025-01-09 03:54:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25561 to 25481. [2025-01-09 03:54:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25481 states, 21393 states have (on average 1.5545739260505773) internal successors, (33257), 21496 states have internal predecessors, (33257), 3628 states have call successors, (3628), 440 states have call predecessors, (3628), 459 states have return successors, (4164), 3606 states have call predecessors, (4164), 3590 states have call successors, (4164) [2025-01-09 03:54:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25481 states to 25481 states and 41049 transitions. [2025-01-09 03:54:09,932 INFO L78 Accepts]: Start accepts. Automaton has 25481 states and 41049 transitions. Word has length 209 [2025-01-09 03:54:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:09,933 INFO L471 AbstractCegarLoop]: Abstraction has 25481 states and 41049 transitions. [2025-01-09 03:54:09,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 25481 states and 41049 transitions. [2025-01-09 03:54:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 03:54:09,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:09,975 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:09,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:54:09,975 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1627000070, now seen corresponding path program 1 times [2025-01-09 03:54:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:09,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842392125] [2025-01-09 03:54:09,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:09,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 03:54:09,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 03:54:09,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:09,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842392125] [2025-01-09 03:54:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842392125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:10,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:10,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:10,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069107964] [2025-01-09 03:54:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:10,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:10,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:10,028 INFO L87 Difference]: Start difference. First operand 25481 states and 41049 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:10,785 INFO L93 Difference]: Finished difference Result 60475 states and 98117 transitions. [2025-01-09 03:54:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 210 [2025-01-09 03:54:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:10,923 INFO L225 Difference]: With dead ends: 60475 [2025-01-09 03:54:10,923 INFO L226 Difference]: Without dead ends: 38841 [2025-01-09 03:54:10,973 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-01-09 03:54:10,975 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 155 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1718 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-01-09 03:54:10,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1718 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38841 states. [2025-01-09 03:54:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38841 to 38761. [2025-01-09 03:54:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38761 states, 32701 states have (on average 1.5575364667747165) internal successors, (50933), 32804 states have internal predecessors, (50933), 5600 states have call successors, (5600), 440 states have call predecessors, (5600), 459 states have return successors, (6312), 5578 states have call predecessors, (6312), 5562 states have call successors, (6312) [2025-01-09 03:54:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38761 states to 38761 states and 62845 transitions. [2025-01-09 03:54:12,540 INFO L78 Accepts]: Start accepts. Automaton has 38761 states and 62845 transitions. Word has length 210 [2025-01-09 03:54:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:12,541 INFO L471 AbstractCegarLoop]: Abstraction has 38761 states and 62845 transitions. [2025-01-09 03:54:12,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 38761 states and 62845 transitions. [2025-01-09 03:54:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 03:54:12,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:12,613 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:12,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:54:12,613 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:12,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash -502809968, now seen corresponding path program 1 times [2025-01-09 03:54:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856881746] [2025-01-09 03:54:12,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:12,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 03:54:12,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 03:54:12,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:12,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856881746] [2025-01-09 03:54:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856881746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57072702] [2025-01-09 03:54:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:12,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:12,675 INFO L87 Difference]: Start difference. First operand 38761 states and 62845 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:13,961 INFO L93 Difference]: Finished difference Result 95755 states and 156645 transitions. [2025-01-09 03:54:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 211 [2025-01-09 03:54:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:14,298 INFO L225 Difference]: With dead ends: 95755 [2025-01-09 03:54:14,299 INFO L226 Difference]: Without dead ends: 62761 [2025-01-09 03:54:14,450 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-01-09 03:54:14,453 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 153 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1716 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-01-09 03:54:14,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1716 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62761 states. [2025-01-09 03:54:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62761 to 62681. [2025-01-09 03:54:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62681 states, 53333 states have (on average 1.5668535428346426) internal successors, (83565), 53436 states have internal predecessors, (83565), 8888 states have call successors, (8888), 440 states have call predecessors, (8888), 459 states have return successors, (9912), 8866 states have call predecessors, (9912), 8850 states have call successors, (9912) [2025-01-09 03:54:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62681 states to 62681 states and 102365 transitions. [2025-01-09 03:54:17,321 INFO L78 Accepts]: Start accepts. Automaton has 62681 states and 102365 transitions. Word has length 211 [2025-01-09 03:54:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:17,321 INFO L471 AbstractCegarLoop]: Abstraction has 62681 states and 102365 transitions. [2025-01-09 03:54:17,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 62681 states and 102365 transitions. [2025-01-09 03:54:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 03:54:17,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:17,469 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:17,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:54:17,470 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:17,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1659394861, now seen corresponding path program 1 times [2025-01-09 03:54:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:17,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572805244] [2025-01-09 03:54:17,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:17,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 03:54:17,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 03:54:17,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:17,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572805244] [2025-01-09 03:54:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572805244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:17,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236842663] [2025-01-09 03:54:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:17,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:17,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:17,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:17,551 INFO L87 Difference]: Start difference. First operand 62681 states and 102365 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:20,025 INFO L93 Difference]: Finished difference Result 150039 states and 244105 transitions. [2025-01-09 03:54:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:20,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 212 [2025-01-09 03:54:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:20,373 INFO L225 Difference]: With dead ends: 150039 [2025-01-09 03:54:20,373 INFO L226 Difference]: Without dead ends: 97573 [2025-01-09 03:54:20,482 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-01-09 03:54:20,483 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 151 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1709 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-01-09 03:54:20,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1709 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97573 states. [2025-01-09 03:54:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97573 to 97493. [2025-01-09 03:54:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97493 states, 83333 states have (on average 1.542882171528686) internal successors, (128573), 83436 states have internal predecessors, (128573), 13700 states have call successors, (13700), 440 states have call predecessors, (13700), 459 states have return successors, (15300), 13678 states have call predecessors, (15300), 13662 states have call successors, (15300) [2025-01-09 03:54:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97493 states to 97493 states and 157573 transitions. [2025-01-09 03:54:24,352 INFO L78 Accepts]: Start accepts. Automaton has 97493 states and 157573 transitions. Word has length 212 [2025-01-09 03:54:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:24,353 INFO L471 AbstractCegarLoop]: Abstraction has 97493 states and 157573 transitions. [2025-01-09 03:54:24,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 03:54:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97493 states and 157573 transitions. [2025-01-09 03:54:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 03:54:24,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:24,856 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:54:24,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:54:24,857 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:24,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1782514328, now seen corresponding path program 1 times [2025-01-09 03:54:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845644303] [2025-01-09 03:54:24,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:24,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 03:54:24,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 03:54:24,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:54:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845644303] [2025-01-09 03:54:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845644303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:24,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412368654] [2025-01-09 03:54:24,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:24,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:24,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:24,918 INFO L87 Difference]: Start difference. First operand 97493 states and 157573 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25)