./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product16.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_spec6_product16.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 14dde7567748bafe076b052fc50547f9c42c454af1c5c326a7b2a07549e9af32 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:54:59,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:54:59,385 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:54:59,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:54:59,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:54:59,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:54:59,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:54:59,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:54:59,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:54:59,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:54:59,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:54:59,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:54:59,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:54:59,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:54:59,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:59,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:59,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:54:59,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:54:59,421 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 -> 14dde7567748bafe076b052fc50547f9c42c454af1c5c326a7b2a07549e9af32 [2025-01-09 03:54:59,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:54:59,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:54:59,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:54:59,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:54:59,683 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:54:59,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product16.cil.c [2025-01-09 03:55:00,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eec40693f/fc2fad23895649e681745fe8785e0373/FLAG6b7c8e8e7 [2025-01-09 03:55:01,315 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:55:01,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product16.cil.c [2025-01-09 03:55:01,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eec40693f/fc2fad23895649e681745fe8785e0373/FLAG6b7c8e8e7 [2025-01-09 03:55:01,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eec40693f/fc2fad23895649e681745fe8785e0373 [2025-01-09 03:55:01,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:55:01,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:55:01,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:01,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:55:01,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:55:01,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:01" (1/1) ... [2025-01-09 03:55:01,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e194ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:01, skipping insertion in model container [2025-01-09 03:55:01,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:01" (1/1) ... [2025-01-09 03:55:01,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:55:01,874 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_spec6_product16.cil.c[39829,39842] [2025-01-09 03:55:01,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:01,975 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:55:01,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:55:01,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [363] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1435] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1847] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1856] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2222] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2257] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2473] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2578] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [2595] [2025-01-09 03:55:01,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2642] [2025-01-09 03:55:02,046 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_spec6_product16.cil.c[39829,39842] [2025-01-09 03:55:02,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:02,115 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:55:02,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02 WrapperNode [2025-01-09 03:55:02,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:02,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:02,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:55:02,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:55:02,122 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:55:02" (1/1) ... [2025-01-09 03:55:02,142 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:55:02" (1/1) ... [2025-01-09 03:55:02,192 INFO L138 Inliner]: procedures = 126, calls = 187, calls flagged for inlining = 55, calls inlined = 50, statements flattened = 974 [2025-01-09 03:55:02,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:02,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:55:02,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:55:02,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:55:02,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,242 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:55:02,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:55:02,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:55:02,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:55:02,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:55:02,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (1/1) ... [2025-01-09 03:55:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:02,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:02,333 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:55:02,336 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:55:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:55:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:55:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:55:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:55:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:55:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:55:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:55:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:55:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:55:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:55:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:55:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:55:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:55:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:55:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:55:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:55:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:55:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:55:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:55:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:55:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:55:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:55:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:55:02,360 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:55:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:55:02,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:55:02,508 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:55:02,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:55:03,110 INFO L? ?]: Removed 412 outVars from TransFormulas that were not future-live. [2025-01-09 03:55:03,111 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:55:03,127 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:55:03,129 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:55:03,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:03 BoogieIcfgContainer [2025-01-09 03:55:03,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:55:03,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:55:03,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:55:03,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:55:03,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:01" (1/3) ... [2025-01-09 03:55:03,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c850b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:03, skipping insertion in model container [2025-01-09 03:55:03,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:02" (2/3) ... [2025-01-09 03:55:03,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c850b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:03, skipping insertion in model container [2025-01-09 03:55:03,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:03" (3/3) ... [2025-01-09 03:55:03,139 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product16.cil.c [2025-01-09 03:55:03,151 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:55:03,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product16.cil.c that has 19 procedures, 310 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:55:03,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:55:03,230 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;@7325010e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:55:03,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:55:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 310 states, 241 states have (on average 1.5186721991701244) internal successors, (366), 245 states have internal predecessors, (366), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:55:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:55:03,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:03,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:03,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:03,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash 829520660, now seen corresponding path program 1 times [2025-01-09 03:55:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232808046] [2025-01-09 03:55:03,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:03,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:55:03,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:55:03,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:03,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:55:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232808046] [2025-01-09 03:55:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232808046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949014036] [2025-01-09 03:55:03,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:03,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:03,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:03,875 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:55:03,875 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:55:04,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:55:04,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:55:04,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:04,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:04,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:55:04,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:55:04,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:04,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949014036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:04,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:04,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:55:04,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149942165] [2025-01-09 03:55:04,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:04,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:55:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:04,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:55:04,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:04,206 INFO L87 Difference]: Start difference. First operand has 310 states, 241 states have (on average 1.5186721991701244) internal successors, (366), 245 states have internal predecessors, (366), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:04,238 INFO L93 Difference]: Finished difference Result 467 states and 684 transitions. [2025-01-09 03:55:04,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:55:04,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2025-01-09 03:55:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:04,246 INFO L225 Difference]: With dead ends: 467 [2025-01-09 03:55:04,247 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 03:55:04,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:04,251 INFO L435 NwaCegarLoop]: 461 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, 461 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:55:04,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 03:55:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-01-09 03:55:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.5148936170212766) internal successors, (356), 238 states have internal predecessors, (356), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 03:55:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 453 transitions. [2025-01-09 03:55:04,292 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 453 transitions. Word has length 114 [2025-01-09 03:55:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:04,293 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 453 transitions. [2025-01-09 03:55:04,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 453 transitions. [2025-01-09 03:55:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:55:04,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:04,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:04,306 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:55:04,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:55:04,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:04,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -212990598, now seen corresponding path program 1 times [2025-01-09 03:55:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45857162] [2025-01-09 03:55:04,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:04,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:55:04,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:55:04,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:04,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:55:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45857162] [2025-01-09 03:55:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45857162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89202440] [2025-01-09 03:55:04,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:04,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:04,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:04,718 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:55:04,720 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:55:04,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:55:04,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:55:04,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:04,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:04,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:55:04,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:55:05,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:05,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89202440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:05,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:05,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218989049] [2025-01-09 03:55:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:05,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:05,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:05,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:05,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:05,019 INFO L87 Difference]: Start difference. First operand 303 states and 453 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:05,084 INFO L93 Difference]: Finished difference Result 456 states and 665 transitions. [2025-01-09 03:55:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2025-01-09 03:55:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:05,087 INFO L225 Difference]: With dead ends: 456 [2025-01-09 03:55:05,087 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 03:55:05,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 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:55:05,092 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 900 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:55:05,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 900 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 03:55:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2025-01-09 03:55:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 236 states have (on average 1.5127118644067796) internal successors, (357), 239 states have internal predecessors, (357), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 03:55:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 454 transitions. [2025-01-09 03:55:05,129 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 454 transitions. Word has length 114 [2025-01-09 03:55:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:05,129 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 454 transitions. [2025-01-09 03:55:05,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 454 transitions. [2025-01-09 03:55:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:55:05,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:05,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:05,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:05,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:05,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:05,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -806642877, now seen corresponding path program 1 times [2025-01-09 03:55:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617443432] [2025-01-09 03:55:05,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:05,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:55:05,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:55:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:55:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:05,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617443432] [2025-01-09 03:55:05,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617443432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:05,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684680378] [2025-01-09 03:55:05,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:05,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:05,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:05,626 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:55:05,631 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:55:05,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:55:05,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:55:05,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:05,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:05,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:05,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:55:05,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684680378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:05,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:05,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:05,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027040275] [2025-01-09 03:55:05,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:05,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:05,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:05,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:05,944 INFO L87 Difference]: Start difference. First operand 304 states and 454 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:05,984 INFO L93 Difference]: Finished difference Result 638 states and 967 transitions. [2025-01-09 03:55:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:05,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-01-09 03:55:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:05,988 INFO L225 Difference]: With dead ends: 638 [2025-01-09 03:55:05,988 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 03:55:05,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 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:55:05,994 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 107 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 878 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:55:05,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 878 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 03:55:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 352. [2025-01-09 03:55:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 273 states have (on average 1.531135531135531) internal successors, (418), 276 states have internal predecessors, (418), 60 states have call successors, (60), 18 states have call predecessors, (60), 18 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 03:55:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 537 transitions. [2025-01-09 03:55:06,026 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 537 transitions. Word has length 119 [2025-01-09 03:55:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 537 transitions. [2025-01-09 03:55:06,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 537 transitions. [2025-01-09 03:55:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:55:06,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:06,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:06,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:55:06,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:06,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash -145721591, now seen corresponding path program 1 times [2025-01-09 03:55:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:06,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965602671] [2025-01-09 03:55:06,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:55:06,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:55:06,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:06,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:55:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:06,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965602671] [2025-01-09 03:55:06,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965602671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:06,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593374953] [2025-01-09 03:55:06,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:06,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:06,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:06,438 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:55:06,446 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:55:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:55:06,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:55:06,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:06,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:06,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:55:06,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:55:06,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:06,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593374953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:06,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:06,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:55:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522054918] [2025-01-09 03:55:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:06,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:06,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:06,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:06,724 INFO L87 Difference]: Start difference. First operand 352 states and 537 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:06,767 INFO L93 Difference]: Finished difference Result 695 states and 1064 transitions. [2025-01-09 03:55:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2025-01-09 03:55:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:06,771 INFO L225 Difference]: With dead ends: 695 [2025-01-09 03:55:06,773 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 03:55:06,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:06,774 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 2 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:06,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1769 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 03:55:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-01-09 03:55:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 274 states have (on average 1.5291970802919708) internal successors, (419), 278 states have internal predecessors, (419), 60 states have call successors, (60), 18 states have call predecessors, (60), 19 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2025-01-09 03:55:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 540 transitions. [2025-01-09 03:55:06,795 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 540 transitions. Word has length 120 [2025-01-09 03:55:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:06,795 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 540 transitions. [2025-01-09 03:55:06,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 540 transitions. [2025-01-09 03:55:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:55:06,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:06,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:06,809 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:55:07,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:07,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:07,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1493077658, now seen corresponding path program 1 times [2025-01-09 03:55:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:07,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485208047] [2025-01-09 03:55:07,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:55:07,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:55:07,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:07,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:55:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:07,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485208047] [2025-01-09 03:55:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485208047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729716982] [2025-01-09 03:55:07,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:07,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:07,184 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:55:07,185 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:55:07,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:55:07,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:55:07,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:07,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:07,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:55:07,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:55:07,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729716982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:55:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102866344] [2025-01-09 03:55:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:07,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:07,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:07,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:07,537 INFO L87 Difference]: Start difference. First operand 354 states and 540 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:07,602 INFO L93 Difference]: Finished difference Result 697 states and 1069 transitions. [2025-01-09 03:55:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2025-01-09 03:55:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:07,606 INFO L225 Difference]: With dead ends: 697 [2025-01-09 03:55:07,606 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 03:55:07,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:07,608 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 2 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:07,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1755 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 03:55:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-01-09 03:55:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 275 states have (on average 1.5272727272727273) internal successors, (420), 280 states have internal predecessors, (420), 60 states have call successors, (60), 18 states have call predecessors, (60), 20 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2025-01-09 03:55:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 546 transitions. [2025-01-09 03:55:07,632 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 546 transitions. Word has length 121 [2025-01-09 03:55:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:07,633 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 546 transitions. [2025-01-09 03:55:07,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 546 transitions. [2025-01-09 03:55:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:55:07,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:07,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:07,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:07,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:07,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:07,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1705324185, now seen corresponding path program 1 times [2025-01-09 03:55:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:07,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767494176] [2025-01-09 03:55:07,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:07,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:55:07,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:55:07,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:07,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:55:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:08,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767494176] [2025-01-09 03:55:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767494176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:08,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:08,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80153568] [2025-01-09 03:55:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:08,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:08,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:08,023 INFO L87 Difference]: Start difference. First operand 356 states and 546 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:08,055 INFO L93 Difference]: Finished difference Result 689 states and 1060 transitions. [2025-01-09 03:55:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2025-01-09 03:55:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:08,058 INFO L225 Difference]: With dead ends: 689 [2025-01-09 03:55:08,058 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 03:55:08,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:08,060 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 2 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:08,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1773 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 03:55:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-01-09 03:55:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 275 states have (on average 1.5272727272727273) internal successors, (420), 280 states have internal predecessors, (420), 60 states have call successors, (60), 18 states have call predecessors, (60), 20 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2025-01-09 03:55:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 545 transitions. [2025-01-09 03:55:08,071 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 545 transitions. Word has length 122 [2025-01-09 03:55:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:08,071 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 545 transitions. [2025-01-09 03:55:08,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 545 transitions. [2025-01-09 03:55:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:55:08,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:08,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:08,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:55:08,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:08,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1645501798, now seen corresponding path program 2 times [2025-01-09 03:55:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254375472] [2025-01-09 03:55:08,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:55:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:08,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-01-09 03:55:08,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:55:08,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:55:08,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:55:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254375472] [2025-01-09 03:55:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254375472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:08,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:08,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695029853] [2025-01-09 03:55:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:08,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:08,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:08,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:08,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:08,167 INFO L87 Difference]: Start difference. First operand 356 states and 545 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:08,207 INFO L93 Difference]: Finished difference Result 687 states and 1055 transitions. [2025-01-09 03:55:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-01-09 03:55:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:08,209 INFO L225 Difference]: With dead ends: 687 [2025-01-09 03:55:08,209 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 03:55:08,210 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:55:08,211 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:08,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1759 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 03:55:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-01-09 03:55:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 275 states have (on average 1.5272727272727273) internal successors, (420), 280 states have internal predecessors, (420), 60 states have call successors, (60), 18 states have call predecessors, (60), 20 states have return successors, (64), 59 states have call predecessors, (64), 59 states have call successors, (64) [2025-01-09 03:55:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 544 transitions. [2025-01-09 03:55:08,222 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 544 transitions. Word has length 123 [2025-01-09 03:55:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:08,222 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 544 transitions. [2025-01-09 03:55:08,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 544 transitions. [2025-01-09 03:55:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:55:08,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:08,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:08,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:55:08,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:08,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 652264137, now seen corresponding path program 3 times [2025-01-09 03:55:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170379054] [2025-01-09 03:55:08,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:55:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:08,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 124 statements into 3 equivalence classes. [2025-01-09 03:55:08,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 112 of 124 statements. [2025-01-09 03:55:08,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:55:08,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:55:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:08,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170379054] [2025-01-09 03:55:08,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170379054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:08,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:08,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:55:08,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331976974] [2025-01-09 03:55:08,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:08,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:55:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:08,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:55:08,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:55:08,444 INFO L87 Difference]: Start difference. First operand 356 states and 544 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:08,854 INFO L93 Difference]: Finished difference Result 916 states and 1336 transitions. [2025-01-09 03:55:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:55:08,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-01-09 03:55:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:08,859 INFO L225 Difference]: With dead ends: 916 [2025-01-09 03:55:08,859 INFO L226 Difference]: Without dead ends: 772 [2025-01-09 03:55:08,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:55:08,861 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1405 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:08,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 3104 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:55:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-01-09 03:55:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 764. [2025-01-09 03:55:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 592 states have (on average 1.4712837837837838) internal successors, (871), 606 states have internal predecessors, (871), 116 states have call successors, (116), 48 states have call predecessors, (116), 55 states have return successors, (134), 117 states have call predecessors, (134), 112 states have call successors, (134) [2025-01-09 03:55:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1121 transitions. [2025-01-09 03:55:08,941 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1121 transitions. Word has length 124 [2025-01-09 03:55:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:08,942 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1121 transitions. [2025-01-09 03:55:08,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1121 transitions. [2025-01-09 03:55:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:55:08,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:08,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:08,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:55:08,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2021236928, now seen corresponding path program 1 times [2025-01-09 03:55:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727415547] [2025-01-09 03:55:08,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:55:09,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:55:09,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:09,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:55:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727415547] [2025-01-09 03:55:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727415547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913672304] [2025-01-09 03:55:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:09,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:09,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:09,161 INFO L87 Difference]: Start difference. First operand 764 states and 1121 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:09,213 INFO L93 Difference]: Finished difference Result 1507 states and 2215 transitions. [2025-01-09 03:55:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-01-09 03:55:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:09,219 INFO L225 Difference]: With dead ends: 1507 [2025-01-09 03:55:09,219 INFO L226 Difference]: Without dead ends: 766 [2025-01-09 03:55:09,223 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:55:09,223 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:09,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1776 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-09 03:55:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2025-01-09 03:55:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 593 states have (on average 1.4704890387858347) internal successors, (872), 608 states have internal predecessors, (872), 116 states have call successors, (116), 48 states have call predecessors, (116), 56 states have return successors, (136), 117 states have call predecessors, (136), 112 states have call successors, (136) [2025-01-09 03:55:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1124 transitions. [2025-01-09 03:55:09,258 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1124 transitions. Word has length 125 [2025-01-09 03:55:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:09,258 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1124 transitions. [2025-01-09 03:55:09,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1124 transitions. [2025-01-09 03:55:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:55:09,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:09,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:09,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:55:09,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:09,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:09,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1866242872, now seen corresponding path program 1 times [2025-01-09 03:55:09,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:09,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631685934] [2025-01-09 03:55:09,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:09,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:09,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:55:09,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:55:09,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:09,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:55:09,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:09,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631685934] [2025-01-09 03:55:09,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631685934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:09,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:09,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:09,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239400037] [2025-01-09 03:55:09,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:09,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:09,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:09,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:09,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:09,394 INFO L87 Difference]: Start difference. First operand 766 states and 1124 transitions. Second operand has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:55:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:09,510 INFO L93 Difference]: Finished difference Result 1512 states and 2224 transitions. [2025-01-09 03:55:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:55:09,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 126 [2025-01-09 03:55:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:09,515 INFO L225 Difference]: With dead ends: 1512 [2025-01-09 03:55:09,516 INFO L226 Difference]: Without dead ends: 771 [2025-01-09 03:55:09,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:55:09,519 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 5 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:09,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3044 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:55:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-01-09 03:55:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2025-01-09 03:55:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 597 states have (on average 1.4690117252931323) internal successors, (877), 612 states have internal predecessors, (877), 116 states have call successors, (116), 49 states have call predecessors, (116), 57 states have return successors, (141), 117 states have call predecessors, (141), 112 states have call successors, (141) [2025-01-09 03:55:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1134 transitions. [2025-01-09 03:55:09,549 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1134 transitions. Word has length 126 [2025-01-09 03:55:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1134 transitions. [2025-01-09 03:55:09,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:55:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1134 transitions. [2025-01-09 03:55:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:55:09,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:09,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:09,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:55:09,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:09,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1517997934, now seen corresponding path program 1 times [2025-01-09 03:55:09,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:09,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868410320] [2025-01-09 03:55:09,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:09,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:55:09,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:55:09,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:09,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:55:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868410320] [2025-01-09 03:55:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868410320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000315480] [2025-01-09 03:55:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:09,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:09,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:09,642 INFO L87 Difference]: Start difference. First operand 771 states and 1134 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:09,698 INFO L93 Difference]: Finished difference Result 1514 states and 2232 transitions. [2025-01-09 03:55:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-01-09 03:55:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:09,704 INFO L225 Difference]: With dead ends: 1514 [2025-01-09 03:55:09,704 INFO L226 Difference]: Without dead ends: 773 [2025-01-09 03:55:09,707 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:55:09,707 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:09,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1755 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-01-09 03:55:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 771. [2025-01-09 03:55:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 597 states have (on average 1.4690117252931323) internal successors, (877), 612 states have internal predecessors, (877), 116 states have call successors, (116), 49 states have call predecessors, (116), 57 states have return successors, (141), 117 states have call predecessors, (141), 112 states have call successors, (141) [2025-01-09 03:55:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1134 transitions. [2025-01-09 03:55:09,735 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1134 transitions. Word has length 127 [2025-01-09 03:55:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:09,735 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1134 transitions. [2025-01-09 03:55:09,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:55:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1134 transitions. [2025-01-09 03:55:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:55:09,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:09,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:09,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:55:09,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash 193141740, now seen corresponding path program 1 times [2025-01-09 03:55:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65342402] [2025-01-09 03:55:09,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:09,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:55:09,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:55:09,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:09,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:09,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:09,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65342402] [2025-01-09 03:55:09,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65342402] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:09,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479805313] [2025-01-09 03:55:09,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:09,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:09,843 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:55:09,856 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:55:10,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:55:10,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:55:10,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:10,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:10,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:10,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:10,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:55:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479805313] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:55:10,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:55:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:55:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644103689] [2025-01-09 03:55:10,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:55:10,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:55:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:10,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:55:10,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:55:10,197 INFO L87 Difference]: Start difference. First operand 771 states and 1134 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:55:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:10,330 INFO L93 Difference]: Finished difference Result 1730 states and 2586 transitions. [2025-01-09 03:55:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:55:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 127 [2025-01-09 03:55:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:10,338 INFO L225 Difference]: With dead ends: 1730 [2025-01-09 03:55:10,338 INFO L226 Difference]: Without dead ends: 1171 [2025-01-09 03:55:10,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 251 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:55:10,343 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 418 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:10,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1752 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:55:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-01-09 03:55:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1093. [2025-01-09 03:55:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 855 states have (on average 1.5309941520467836) internal successors, (1309), 870 states have internal predecessors, (1309), 180 states have call successors, (180), 49 states have call predecessors, (180), 57 states have return successors, (215), 181 states have call predecessors, (215), 176 states have call successors, (215) [2025-01-09 03:55:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1704 transitions. [2025-01-09 03:55:10,386 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1704 transitions. Word has length 127 [2025-01-09 03:55:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1704 transitions. [2025-01-09 03:55:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:55:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1704 transitions. [2025-01-09 03:55:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 03:55:10,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:10,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:10,398 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:55:10,590 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,SelfDestructingSolverStorable11 [2025-01-09 03:55:10,591 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:10,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1668651921, now seen corresponding path program 1 times [2025-01-09 03:55:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:10,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304663226] [2025-01-09 03:55:10,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:10,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 03:55:10,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 03:55:10,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:10,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:10,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:10,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304663226] [2025-01-09 03:55:10,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304663226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:10,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886388103] [2025-01-09 03:55:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:10,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:10,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:10,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:10,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:10,645 INFO L87 Difference]: Start difference. First operand 1093 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:10,692 INFO L93 Difference]: Finished difference Result 2461 states and 3892 transitions. [2025-01-09 03:55:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-01-09 03:55:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:10,700 INFO L225 Difference]: With dead ends: 2461 [2025-01-09 03:55:10,700 INFO L226 Difference]: Without dead ends: 1437 [2025-01-09 03:55:10,704 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:55:10,705 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 105 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 916 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:55:10,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 916 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-01-09 03:55:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1411. [2025-01-09 03:55:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1109 states have (on average 1.557258791704238) internal successors, (1727), 1124 states have internal predecessors, (1727), 244 states have call successors, (244), 49 states have call predecessors, (244), 57 states have return successors, (289), 245 states have call predecessors, (289), 240 states have call successors, (289) [2025-01-09 03:55:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2260 transitions. [2025-01-09 03:55:10,763 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2260 transitions. Word has length 134 [2025-01-09 03:55:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:10,764 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2260 transitions. [2025-01-09 03:55:10,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2260 transitions. [2025-01-09 03:55:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:55:10,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:10,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:55:10,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1537422652, now seen corresponding path program 1 times [2025-01-09 03:55:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800500632] [2025-01-09 03:55:10,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:10,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:55:10,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:55:10,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:10,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800500632] [2025-01-09 03:55:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800500632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:10,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:10,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427728348] [2025-01-09 03:55:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:10,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:10,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:10,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:10,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:10,866 INFO L87 Difference]: Start difference. First operand 1411 states and 2260 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:10,948 INFO L93 Difference]: Finished difference Result 3224 states and 5208 transitions. [2025-01-09 03:55:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-01-09 03:55:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:10,958 INFO L225 Difference]: With dead ends: 3224 [2025-01-09 03:55:10,958 INFO L226 Difference]: Without dead ends: 1933 [2025-01-09 03:55:10,963 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:55:10,963 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 103 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 900 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:55:10,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 900 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-01-09 03:55:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1907. [2025-01-09 03:55:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1510 states have (on average 1.5801324503311258) internal successors, (2386), 1525 states have internal predecessors, (2386), 339 states have call successors, (339), 49 states have call predecessors, (339), 57 states have return successors, (384), 340 states have call predecessors, (384), 335 states have call successors, (384) [2025-01-09 03:55:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 3109 transitions. [2025-01-09 03:55:11,057 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 3109 transitions. Word has length 135 [2025-01-09 03:55:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:11,057 INFO L471 AbstractCegarLoop]: Abstraction has 1907 states and 3109 transitions. [2025-01-09 03:55:11,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 3109 transitions. [2025-01-09 03:55:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:55:11,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:11,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:11,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:55:11,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:11,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1780897679, now seen corresponding path program 1 times [2025-01-09 03:55:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:11,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526666229] [2025-01-09 03:55:11,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:11,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:55:11,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:55:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:11,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526666229] [2025-01-09 03:55:11,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526666229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:11,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:11,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805457139] [2025-01-09 03:55:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:11,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:11,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:11,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:11,136 INFO L87 Difference]: Start difference. First operand 1907 states and 3109 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:11,224 INFO L93 Difference]: Finished difference Result 4348 states and 7155 transitions. [2025-01-09 03:55:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:11,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-01-09 03:55:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:11,246 INFO L225 Difference]: With dead ends: 4348 [2025-01-09 03:55:11,247 INFO L226 Difference]: Without dead ends: 2682 [2025-01-09 03:55:11,257 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:55:11,259 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 101 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 895 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:55:11,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 895 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2025-01-09 03:55:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2656. [2025-01-09 03:55:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2136 states have (on average 1.5997191011235956) internal successors, (3417), 2151 states have internal predecessors, (3417), 462 states have call successors, (462), 49 states have call predecessors, (462), 57 states have return successors, (523), 463 states have call predecessors, (523), 458 states have call successors, (523) [2025-01-09 03:55:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4402 transitions. [2025-01-09 03:55:11,442 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4402 transitions. Word has length 136 [2025-01-09 03:55:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:11,443 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 4402 transitions. [2025-01-09 03:55:11,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4402 transitions. [2025-01-09 03:55:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 03:55:11,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:11,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:11,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:55:11,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:11,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1968985285, now seen corresponding path program 1 times [2025-01-09 03:55:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:11,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447806166] [2025-01-09 03:55:11,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:11,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:55:11,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:55:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:11,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:11,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447806166] [2025-01-09 03:55:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447806166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:11,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670614400] [2025-01-09 03:55:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:11,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:11,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:11,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:11,512 INFO L87 Difference]: Start difference. First operand 2656 states and 4402 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:11,605 INFO L93 Difference]: Finished difference Result 6096 states and 10186 transitions. [2025-01-09 03:55:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:11,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-01-09 03:55:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:11,626 INFO L225 Difference]: With dead ends: 6096 [2025-01-09 03:55:11,626 INFO L226 Difference]: Without dead ends: 3878 [2025-01-09 03:55:11,635 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:55:11,636 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 99 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 895 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:55:11,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 895 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2025-01-09 03:55:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3852. [2025-01-09 03:55:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3153 states have (on average 1.61465271170314) internal successors, (5091), 3168 states have internal predecessors, (5091), 641 states have call successors, (641), 49 states have call predecessors, (641), 57 states have return successors, (728), 642 states have call predecessors, (728), 637 states have call successors, (728) [2025-01-09 03:55:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 6460 transitions. [2025-01-09 03:55:11,832 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 6460 transitions. Word has length 137 [2025-01-09 03:55:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:11,832 INFO L471 AbstractCegarLoop]: Abstraction has 3852 states and 6460 transitions. [2025-01-09 03:55:11,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 6460 transitions. [2025-01-09 03:55:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:55:11,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:11,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:55:11,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:11,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1869021171, now seen corresponding path program 1 times [2025-01-09 03:55:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214514575] [2025-01-09 03:55:11,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:11,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:55:11,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:55:11,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:11,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:11,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214514575] [2025-01-09 03:55:11,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214514575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:11,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:11,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118811338] [2025-01-09 03:55:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:11,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:11,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:11,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:11,915 INFO L87 Difference]: Start difference. First operand 3852 states and 6460 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:12,055 INFO L93 Difference]: Finished difference Result 8967 states and 15156 transitions. [2025-01-09 03:55:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-01-09 03:55:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:12,086 INFO L225 Difference]: With dead ends: 8967 [2025-01-09 03:55:12,086 INFO L226 Difference]: Without dead ends: 5854 [2025-01-09 03:55:12,100 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:55:12,102 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 97 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 902 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:55:12,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 902 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2025-01-09 03:55:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5828. [2025-01-09 03:55:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5828 states, 4753 states have (on average 1.6175047338523039) internal successors, (7688), 4768 states have internal predecessors, (7688), 1017 states have call successors, (1017), 49 states have call predecessors, (1017), 57 states have return successors, (1148), 1018 states have call predecessors, (1148), 1013 states have call successors, (1148) [2025-01-09 03:55:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5828 states to 5828 states and 9853 transitions. [2025-01-09 03:55:12,431 INFO L78 Accepts]: Start accepts. Automaton has 5828 states and 9853 transitions. Word has length 138 [2025-01-09 03:55:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:12,432 INFO L471 AbstractCegarLoop]: Abstraction has 5828 states and 9853 transitions. [2025-01-09 03:55:12,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 5828 states and 9853 transitions. [2025-01-09 03:55:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:55:12,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:12,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:12,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:55:12,458 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:12,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash -305406679, now seen corresponding path program 1 times [2025-01-09 03:55:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763285241] [2025-01-09 03:55:12,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:12,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:55:12,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:55:12,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:12,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:12,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763285241] [2025-01-09 03:55:12,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763285241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:12,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:12,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715515603] [2025-01-09 03:55:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:12,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:12,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:12,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:12,524 INFO L87 Difference]: Start difference. First operand 5828 states and 9853 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:12,801 INFO L93 Difference]: Finished difference Result 14171 states and 24133 transitions. [2025-01-09 03:55:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:12,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-01-09 03:55:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:12,862 INFO L225 Difference]: With dead ends: 14171 [2025-01-09 03:55:12,862 INFO L226 Difference]: Without dead ends: 9443 [2025-01-09 03:55:12,880 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:55:12,881 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 95 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 902 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:55:12,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 902 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9443 states. [2025-01-09 03:55:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9443 to 9417. [2025-01-09 03:55:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9417 states, 7736 states have (on average 1.6209927611168562) internal successors, (12540), 7751 states have internal predecessors, (12540), 1623 states have call successors, (1623), 49 states have call predecessors, (1623), 57 states have return successors, (1832), 1624 states have call predecessors, (1832), 1619 states have call successors, (1832) [2025-01-09 03:55:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9417 states to 9417 states and 15995 transitions. [2025-01-09 03:55:13,346 INFO L78 Accepts]: Start accepts. Automaton has 9417 states and 15995 transitions. Word has length 139 [2025-01-09 03:55:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:13,347 INFO L471 AbstractCegarLoop]: Abstraction has 9417 states and 15995 transitions. [2025-01-09 03:55:13,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9417 states and 15995 transitions. [2025-01-09 03:55:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:55:13,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:13,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:13,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:55:13,376 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:13,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash 846823003, now seen corresponding path program 1 times [2025-01-09 03:55:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:13,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353254129] [2025-01-09 03:55:13,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:13,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:55:13,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:55:13,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:13,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353254129] [2025-01-09 03:55:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353254129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559320807] [2025-01-09 03:55:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:13,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:13,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:13,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:13,428 INFO L87 Difference]: Start difference. First operand 9417 states and 15995 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:13,825 INFO L93 Difference]: Finished difference Result 24117 states and 41160 transitions. [2025-01-09 03:55:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-01-09 03:55:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:13,882 INFO L225 Difference]: With dead ends: 24117 [2025-01-09 03:55:13,882 INFO L226 Difference]: Without dead ends: 16230 [2025-01-09 03:55:13,903 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:55:13,904 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 93 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:13,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 912 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16230 states. [2025-01-09 03:55:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16230 to 16204. [2025-01-09 03:55:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16204 states, 13320 states have (on average 1.6153153153153152) internal successors, (21516), 13335 states have internal predecessors, (21516), 2826 states have call successors, (2826), 49 states have call predecessors, (2826), 57 states have return successors, (3179), 2827 states have call predecessors, (3179), 2822 states have call successors, (3179) [2025-01-09 03:55:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16204 states to 16204 states and 27521 transitions. [2025-01-09 03:55:14,682 INFO L78 Accepts]: Start accepts. Automaton has 16204 states and 27521 transitions. Word has length 140 [2025-01-09 03:55:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 16204 states and 27521 transitions. [2025-01-09 03:55:14,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 16204 states and 27521 transitions. [2025-01-09 03:55:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 03:55:14,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:14,727 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:14,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:55:14,727 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:14,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1074319286, now seen corresponding path program 1 times [2025-01-09 03:55:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:14,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079719724] [2025-01-09 03:55:14,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:14,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 03:55:14,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 03:55:14,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:14,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:14,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079719724] [2025-01-09 03:55:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079719724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:14,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:14,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:14,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074600672] [2025-01-09 03:55:14,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:14,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:14,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:14,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:14,794 INFO L87 Difference]: Start difference. First operand 16204 states and 27521 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:15,477 INFO L93 Difference]: Finished difference Result 42643 states and 72779 transitions. [2025-01-09 03:55:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-01-09 03:55:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:15,600 INFO L225 Difference]: With dead ends: 42643 [2025-01-09 03:55:15,600 INFO L226 Difference]: Without dead ends: 28582 [2025-01-09 03:55:15,652 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:55:15,654 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 91 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 898 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:55:15,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 898 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:15,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28582 states. [2025-01-09 03:55:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28582 to 28556. [2025-01-09 03:55:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28556 states, 23633 states have (on average 1.6128718317606736) internal successors, (38117), 23648 states have internal predecessors, (38117), 4865 states have call successors, (4865), 49 states have call predecessors, (4865), 57 states have return successors, (5492), 4866 states have call predecessors, (5492), 4861 states have call successors, (5492) [2025-01-09 03:55:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28556 states to 28556 states and 48474 transitions. [2025-01-09 03:55:17,263 INFO L78 Accepts]: Start accepts. Automaton has 28556 states and 48474 transitions. Word has length 141 [2025-01-09 03:55:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:17,263 INFO L471 AbstractCegarLoop]: Abstraction has 28556 states and 48474 transitions. [2025-01-09 03:55:17,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 28556 states and 48474 transitions. [2025-01-09 03:55:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:55:17,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:17,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:17,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:55:17,313 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:17,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 223962909, now seen corresponding path program 1 times [2025-01-09 03:55:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:17,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750256648] [2025-01-09 03:55:17,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:17,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:55:17,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:55:17,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:17,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750256648] [2025-01-09 03:55:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750256648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:17,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:17,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911262648] [2025-01-09 03:55:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:17,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:17,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:17,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:17,373 INFO L87 Difference]: Start difference. First operand 28556 states and 48474 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:18,808 INFO L93 Difference]: Finished difference Result 77570 states and 132171 transitions. [2025-01-09 03:55:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-01-09 03:55:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:19,022 INFO L225 Difference]: With dead ends: 77570 [2025-01-09 03:55:19,022 INFO L226 Difference]: Without dead ends: 51892 [2025-01-09 03:55:19,085 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:55:19,086 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 89 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 900 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:55:19,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 900 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51892 states. [2025-01-09 03:55:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51892 to 51866. [2025-01-09 03:55:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51866 states, 43228 states have (on average 1.6081474969926899) internal successors, (69517), 43243 states have internal predecessors, (69517), 8580 states have call successors, (8580), 49 states have call predecessors, (8580), 57 states have return successors, (9739), 8581 states have call predecessors, (9739), 8576 states have call successors, (9739) [2025-01-09 03:55:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51866 states to 51866 states and 87836 transitions. [2025-01-09 03:55:21,367 INFO L78 Accepts]: Start accepts. Automaton has 51866 states and 87836 transitions. Word has length 142 [2025-01-09 03:55:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:21,368 INFO L471 AbstractCegarLoop]: Abstraction has 51866 states and 87836 transitions. [2025-01-09 03:55:21,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 51866 states and 87836 transitions. [2025-01-09 03:55:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 03:55:21,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:21,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:55:21,421 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -721497846, now seen corresponding path program 1 times [2025-01-09 03:55:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236867520] [2025-01-09 03:55:21,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:21,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 03:55:21,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 03:55:21,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:21,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236867520] [2025-01-09 03:55:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236867520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:21,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306614338] [2025-01-09 03:55:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:21,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:21,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:21,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:21,484 INFO L87 Difference]: Start difference. First operand 51866 states and 87836 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:23,462 INFO L93 Difference]: Finished difference Result 96822 states and 164270 transitions. [2025-01-09 03:55:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-01-09 03:55:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:23,868 INFO L225 Difference]: With dead ends: 96822 [2025-01-09 03:55:23,868 INFO L226 Difference]: Without dead ends: 96263 [2025-01-09 03:55:23,933 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:55:23,935 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 84 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:23,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 912 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96263 states. [2025-01-09 03:55:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96263 to 96237. [2025-01-09 03:55:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96237 states, 80800 states have (on average 1.6014727722772277) internal successors, (129399), 80815 states have internal predecessors, (129399), 15379 states have call successors, (15379), 49 states have call predecessors, (15379), 57 states have return successors, (17584), 15380 states have call predecessors, (17584), 15375 states have call successors, (17584) [2025-01-09 03:55:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96237 states to 96237 states and 162362 transitions. [2025-01-09 03:55:27,563 INFO L78 Accepts]: Start accepts. Automaton has 96237 states and 162362 transitions. Word has length 143 [2025-01-09 03:55:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:27,563 INFO L471 AbstractCegarLoop]: Abstraction has 96237 states and 162362 transitions. [2025-01-09 03:55:27,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:55:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 96237 states and 162362 transitions. [2025-01-09 03:55:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 03:55:27,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:27,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:55:27,624 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 257198972, now seen corresponding path program 1 times [2025-01-09 03:55:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220002547] [2025-01-09 03:55:27,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:27,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 03:55:27,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 03:55:27,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:27,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:55:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220002547] [2025-01-09 03:55:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220002547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045385295] [2025-01-09 03:55:28,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:28,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:28,353 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:55:28,355 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:55:28,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 03:55:28,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 03:55:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:28,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:28,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 03:55:28,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:55:29,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045385295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-01-09 03:55:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946795813] [2025-01-09 03:55:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:55:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:29,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:55:29,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:55:29,007 INFO L87 Difference]: Start difference. First operand 96237 states and 162362 transitions. Second operand has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 9 states have internal predecessors, (106), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 03:55:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:33,285 INFO L93 Difference]: Finished difference Result 192713 states and 330368 transitions. [2025-01-09 03:55:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:55:33,286 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 9 states have internal predecessors, (106), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 144 [2025-01-09 03:55:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:34,115 INFO L225 Difference]: With dead ends: 192713 [2025-01-09 03:55:34,116 INFO L226 Difference]: Without dead ends: 192160 [2025-01-09 03:55:34,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 03:55:34,221 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 1048 mSDsluCounter, 3284 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:34,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 3828 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:55:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192160 states. [2025-01-09 03:55:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192160 to 192096. [2025-01-09 03:55:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192096 states, 161325 states have (on average 1.6018410041841005) internal successors, (258417), 161256 states have internal predecessors, (258417), 30606 states have call successors, (30606), 138 states have call predecessors, (30606), 164 states have return successors, (38319), 30725 states have call predecessors, (38319), 30594 states have call successors, (38319) [2025-01-09 03:55:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192096 states to 192096 states and 327342 transitions. [2025-01-09 03:55:41,032 INFO L78 Accepts]: Start accepts. Automaton has 192096 states and 327342 transitions. Word has length 144 [2025-01-09 03:55:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:41,033 INFO L471 AbstractCegarLoop]: Abstraction has 192096 states and 327342 transitions. [2025-01-09 03:55:41,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 9 states have internal predecessors, (106), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 03:55:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 192096 states and 327342 transitions. [2025-01-09 03:55:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:55:41,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:41,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:41,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:41,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:41,376 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:41,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2066582795, now seen corresponding path program 1 times [2025-01-09 03:55:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:41,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165730859] [2025-01-09 03:55:41,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:41,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:55:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:55:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:41,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:41,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:41,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165730859] [2025-01-09 03:55:41,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165730859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:41,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:41,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800668171] [2025-01-09 03:55:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:41,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:41,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:41,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:41,486 INFO L87 Difference]: Start difference. First operand 192096 states and 327342 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 6 states have internal predecessors, (97), 4 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15)