./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product33.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_spec1_product33.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 00f3978296386b105e45bba586b0df56f2d34b783492fc63d6fdcb596a8910f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:51:26,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:51:26,493 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:51:26,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:51:26,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:51:26,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:51:26,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:51:26,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:51:26,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:51:26,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:51:26,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:51:26,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:51:26,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:51:26,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:51:26,530 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:51:26,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:51:26,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:51:26,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:51:26,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:51:26,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:51:26,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:51:26,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:51:26,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:51:26,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:51:26,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:51:26,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:51:26,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:51:26,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:51:26,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:51:26,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:51:26,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:51:26,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:51:26,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:51:26,533 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 -> 00f3978296386b105e45bba586b0df56f2d34b783492fc63d6fdcb596a8910f4 [2025-01-09 03:51:26,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:51:26,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:51:26,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:51:26,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:51:26,790 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:51:26,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product33.cil.c [2025-01-09 03:51:27,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24434630a/c01de0bd1f5c45bcbd63056efc3c075c/FLAG03442adc7 [2025-01-09 03:51:28,259 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:51:28,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product33.cil.c [2025-01-09 03:51:28,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24434630a/c01de0bd1f5c45bcbd63056efc3c075c/FLAG03442adc7 [2025-01-09 03:51:28,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24434630a/c01de0bd1f5c45bcbd63056efc3c075c [2025-01-09 03:51:28,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:51:28,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:51:28,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:51:28,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:51:28,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:51:28,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:28" (1/1) ... [2025-01-09 03:51:28,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1453fc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:28, skipping insertion in model container [2025-01-09 03:51:28,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:28" (1/1) ... [2025-01-09 03:51:28,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:51:28,689 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_spec1_product33.cil.c[1542,1555] [2025-01-09 03:51:28,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:51:28,989 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:51:28,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-01-09 03:51:28,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [57] [2025-01-09 03:51:28,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [75] [2025-01-09 03:51:28,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [234] [2025-01-09 03:51:28,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [600] [2025-01-09 03:51:28,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [829] [2025-01-09 03:51:28,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [867] [2025-01-09 03:51:28,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1275] [2025-01-09 03:51:28,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1303] [2025-01-09 03:51:28,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2376] [2025-01-09 03:51:28,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2661] [2025-01-09 03:51:29,002 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_spec1_product33.cil.c[1542,1555] [2025-01-09 03:51:29,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:51:29,108 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:51:29,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29 WrapperNode [2025-01-09 03:51:29,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:51:29,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:51:29,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:51:29,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:51:29,114 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:51:29" (1/1) ... [2025-01-09 03:51:29,129 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:51:29" (1/1) ... [2025-01-09 03:51:29,173 INFO L138 Inliner]: procedures = 134, calls = 212, calls flagged for inlining = 65, calls inlined = 60, statements flattened = 1076 [2025-01-09 03:51:29,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:51:29,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:51:29,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:51:29,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:51:29,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,215 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:51:29,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:51:29,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:51:29,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:51:29,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:51:29,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (1/1) ... [2025-01-09 03:51:29,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:51:29,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:29,293 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:51:29,296 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:51:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:51:29,313 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:51:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:51:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:51:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:51:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:51:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:51:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:51:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:51:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:51:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:51:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:51:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:51:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:51:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:51:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:51:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:51:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:51:29,318 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:51:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:51:29,318 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:51:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:51:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:51:29,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:51:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:51:29,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:51:29,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:51:29,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:51:29,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:51:29,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:51:29,320 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:51:29,320 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:51:29,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:51:29,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:51:29,494 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:51:29,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:51:30,304 INFO L? ?]: Removed 500 outVars from TransFormulas that were not future-live. [2025-01-09 03:51:30,305 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:51:30,323 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:51:30,323 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:51:30,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:30 BoogieIcfgContainer [2025-01-09 03:51:30,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:51:30,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:51:30,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:51:30,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:51:30,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:51:28" (1/3) ... [2025-01-09 03:51:30,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a782c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:30, skipping insertion in model container [2025-01-09 03:51:30,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:29" (2/3) ... [2025-01-09 03:51:30,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a782c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:30, skipping insertion in model container [2025-01-09 03:51:30,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:30" (3/3) ... [2025-01-09 03:51:30,332 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product33.cil.c [2025-01-09 03:51:30,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:51:30,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product33.cil.c that has 25 procedures, 387 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:51:30,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:51:30,419 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;@1ab72899, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:51:30,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:51:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 387 states, 298 states have (on average 1.5) internal successors, (447), 302 states have internal predecessors, (447), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 03:51:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:51:30,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:30,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:30,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:30,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1217165825, now seen corresponding path program 1 times [2025-01-09 03:51:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651234911] [2025-01-09 03:51:30,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:30,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:30,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:51:30,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:51:30,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:30,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:51:30,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651234911] [2025-01-09 03:51:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651234911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213109428] [2025-01-09 03:51:30,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:30,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:30,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:30,931 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:51:30,933 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:51:31,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:51:31,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:51:31,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:31,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:51:31,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:51:31,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213109428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:51:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812540430] [2025-01-09 03:51:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:31,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:31,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:31,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:31,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:51:31,260 INFO L87 Difference]: Start difference. First operand has 387 states, 298 states have (on average 1.5) internal successors, (447), 302 states have internal predecessors, (447), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:31,326 INFO L93 Difference]: Finished difference Result 618 states and 898 transitions. [2025-01-09 03:51:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-01-09 03:51:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:31,341 INFO L225 Difference]: With dead ends: 618 [2025-01-09 03:51:31,341 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 03:51:31,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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:51:31,350 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:31,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 03:51:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2025-01-09 03:51:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 293 states have (on average 1.4948805460750854) internal successors, (438), 296 states have internal predecessors, (438), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 03:51:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 563 transitions. [2025-01-09 03:51:31,420 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 563 transitions. Word has length 101 [2025-01-09 03:51:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:31,422 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 563 transitions. [2025-01-09 03:51:31,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 563 transitions. [2025-01-09 03:51:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:51:31,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:31,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:31,457 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:51:31,648 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:51:31,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:31,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:31,649 INFO L85 PathProgramCache]: Analyzing trace with hash 356143502, now seen corresponding path program 1 times [2025-01-09 03:51:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779617215] [2025-01-09 03:51:31,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:31,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:51:31,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:51:31,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:31,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:51:31,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779617215] [2025-01-09 03:51:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779617215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714098185] [2025-01-09 03:51:31,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:31,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:31,890 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:51:31,892 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:51:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:51:32,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:51:32,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:32,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:32,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:51:32,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:51:32,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714098185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:32,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:51:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290641847] [2025-01-09 03:51:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:32,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:32,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:51:32,187 INFO L87 Difference]: Start difference. First operand 381 states and 563 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:32,220 INFO L93 Difference]: Finished difference Result 797 states and 1193 transitions. [2025-01-09 03:51:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-01-09 03:51:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:32,228 INFO L225 Difference]: With dead ends: 797 [2025-01-09 03:51:32,228 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 03:51:32,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 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:51:32,231 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 115 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1100 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:51:32,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1100 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 03:51:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 434. [2025-01-09 03:51:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 335 states have (on average 1.5134328358208955) internal successors, (507), 338 states have internal predecessors, (507), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 03:51:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 654 transitions. [2025-01-09 03:51:32,271 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 654 transitions. Word has length 109 [2025-01-09 03:51:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:32,273 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 654 transitions. [2025-01-09 03:51:32,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 654 transitions. [2025-01-09 03:51:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:51:32,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:32,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:32,287 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:51:32,480 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:51:32,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:32,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1055904728, now seen corresponding path program 1 times [2025-01-09 03:51:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298855530] [2025-01-09 03:51:32,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:32,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:51:32,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:51:32,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:32,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:51:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298855530] [2025-01-09 03:51:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298855530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381892086] [2025-01-09 03:51:32,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:32,685 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:51:32,687 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:51:32,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:51:32,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:51:32,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:32,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:32,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:51:32,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:51:33,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381892086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:33,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:33,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:51:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483163595] [2025-01-09 03:51:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:33,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:33,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:51:33,007 INFO L87 Difference]: Start difference. First operand 434 states and 654 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:33,068 INFO L93 Difference]: Finished difference Result 859 states and 1298 transitions. [2025-01-09 03:51:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:33,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-01-09 03:51:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:33,072 INFO L225 Difference]: With dead ends: 859 [2025-01-09 03:51:33,072 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 03:51:33,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 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:51:33,075 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 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:51:33,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 03:51:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-01-09 03:51:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 336 states have (on average 1.5119047619047619) internal successors, (508), 340 states have internal predecessors, (508), 74 states have call successors, (74), 24 states have call predecessors, (74), 25 states have return successors, (75), 73 states have call predecessors, (75), 73 states have call successors, (75) [2025-01-09 03:51:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 657 transitions. [2025-01-09 03:51:33,097 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 657 transitions. Word has length 110 [2025-01-09 03:51:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:33,097 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 657 transitions. [2025-01-09 03:51:33,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 657 transitions. [2025-01-09 03:51:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:51:33,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:33,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:33,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:51:33,300 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:51:33,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:33,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -92095512, now seen corresponding path program 1 times [2025-01-09 03:51:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503217053] [2025-01-09 03:51:33,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:33,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:51:33,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:51:33,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:33,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:51:33,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:33,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503217053] [2025-01-09 03:51:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503217053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:33,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752914963] [2025-01-09 03:51:33,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:33,448 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:51:33,450 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:51:33,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:51:33,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:51:33,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:33,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:33,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:51:33,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:51:33,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752914963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:33,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:51:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817145163] [2025-01-09 03:51:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:33,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:33,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:33,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:51:33,712 INFO L87 Difference]: Start difference. First operand 436 states and 657 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:33,783 INFO L93 Difference]: Finished difference Result 861 states and 1303 transitions. [2025-01-09 03:51:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-01-09 03:51:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:33,786 INFO L225 Difference]: With dead ends: 861 [2025-01-09 03:51:33,786 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:51:33,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:51:33,790 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2191 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:51:33,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2191 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:51:33,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-09 03:51:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 337 states have (on average 1.510385756676558) internal successors, (509), 342 states have internal predecessors, (509), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (80), 73 states have call predecessors, (80), 73 states have call successors, (80) [2025-01-09 03:51:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 663 transitions. [2025-01-09 03:51:33,805 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 663 transitions. Word has length 111 [2025-01-09 03:51:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:33,806 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 663 transitions. [2025-01-09 03:51:33,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 663 transitions. [2025-01-09 03:51:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:51:33,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:33,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:33,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:51:34,008 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:51:34,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:34,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash 408231575, now seen corresponding path program 1 times [2025-01-09 03:51:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49515762] [2025-01-09 03:51:34,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:34,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:34,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:51:34,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:51:34,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:34,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:51:34,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:34,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49515762] [2025-01-09 03:51:34,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49515762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:34,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462474133] [2025-01-09 03:51:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:34,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:34,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:34,158 INFO L87 Difference]: Start difference. First operand 438 states and 663 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:34,201 INFO L93 Difference]: Finished difference Result 853 states and 1294 transitions. [2025-01-09 03:51:34,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:34,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-01-09 03:51:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:34,205 INFO L225 Difference]: With dead ends: 853 [2025-01-09 03:51:34,205 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:51:34,206 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:51:34,207 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2209 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:51:34,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2209 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:51:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-09 03:51:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 337 states have (on average 1.510385756676558) internal successors, (509), 342 states have internal predecessors, (509), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (79), 73 states have call predecessors, (79), 73 states have call successors, (79) [2025-01-09 03:51:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 662 transitions. [2025-01-09 03:51:34,229 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 662 transitions. Word has length 112 [2025-01-09 03:51:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:34,229 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 662 transitions. [2025-01-09 03:51:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 662 transitions. [2025-01-09 03:51:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:51:34,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:34,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:34,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:51:34,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:34,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1421410103, now seen corresponding path program 2 times [2025-01-09 03:51:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:34,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509079788] [2025-01-09 03:51:34,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:51:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:34,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-01-09 03:51:34,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:51:34,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:51:34,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:51:34,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509079788] [2025-01-09 03:51:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509079788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:34,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:34,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590801403] [2025-01-09 03:51:34,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:34,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:34,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:34,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:34,357 INFO L87 Difference]: Start difference. First operand 438 states and 662 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:34,407 INFO L93 Difference]: Finished difference Result 851 states and 1289 transitions. [2025-01-09 03:51:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-01-09 03:51:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:34,410 INFO L225 Difference]: With dead ends: 851 [2025-01-09 03:51:34,410 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:51:34,412 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:51:34,412 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 2 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2195 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:51:34,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2195 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:51:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-09 03:51:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 337 states have (on average 1.510385756676558) internal successors, (509), 342 states have internal predecessors, (509), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (78), 73 states have call predecessors, (78), 73 states have call successors, (78) [2025-01-09 03:51:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 661 transitions. [2025-01-09 03:51:34,433 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 661 transitions. Word has length 113 [2025-01-09 03:51:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:34,433 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 661 transitions. [2025-01-09 03:51:34,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 661 transitions. [2025-01-09 03:51:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:51:34,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:34,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:51:34,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:34,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash -143544614, now seen corresponding path program 3 times [2025-01-09 03:51:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559762850] [2025-01-09 03:51:34,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:51:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:34,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 3 equivalence classes. [2025-01-09 03:51:34,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 102 of 114 statements. [2025-01-09 03:51:34,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:51:34,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:51:34,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:34,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559762850] [2025-01-09 03:51:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559762850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:34,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100383886] [2025-01-09 03:51:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:34,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:34,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:34,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:34,537 INFO L87 Difference]: Start difference. First operand 438 states and 661 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:34,580 INFO L93 Difference]: Finished difference Result 853 states and 1295 transitions. [2025-01-09 03:51:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-01-09 03:51:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:34,583 INFO L225 Difference]: With dead ends: 853 [2025-01-09 03:51:34,583 INFO L226 Difference]: Without dead ends: 440 [2025-01-09 03:51:34,584 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:51:34,584 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2206 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:51:34,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2206 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-01-09 03:51:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-01-09 03:51:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 338 states have (on average 1.5088757396449703) internal successors, (510), 344 states have internal predecessors, (510), 74 states have call successors, (74), 24 states have call predecessors, (74), 27 states have return successors, (83), 73 states have call predecessors, (83), 73 states have call successors, (83) [2025-01-09 03:51:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 667 transitions. [2025-01-09 03:51:34,598 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 667 transitions. Word has length 114 [2025-01-09 03:51:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:34,598 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 667 transitions. [2025-01-09 03:51:34,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 667 transitions. [2025-01-09 03:51:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:51:34,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:34,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:51:34,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1139651772, now seen corresponding path program 1 times [2025-01-09 03:51:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:34,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261588808] [2025-01-09 03:51:34,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:34,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:51:34,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:51:34,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:34,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:51:34,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261588808] [2025-01-09 03:51:34,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261588808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:34,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:34,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:34,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101770233] [2025-01-09 03:51:34,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:34,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:34,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:34,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:34,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:34,733 INFO L87 Difference]: Start difference. First operand 440 states and 667 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:34,773 INFO L93 Difference]: Finished difference Result 859 states and 1305 transitions. [2025-01-09 03:51:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:34,773 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2025-01-09 03:51:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:34,776 INFO L225 Difference]: With dead ends: 859 [2025-01-09 03:51:34,776 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 03:51:34,778 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:51:34,778 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2212 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:51:34,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2212 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 03:51:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-09 03:51:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 339 states have (on average 1.5073746312684366) internal successors, (511), 346 states have internal predecessors, (511), 74 states have call successors, (74), 24 states have call predecessors, (74), 28 states have return successors, (85), 73 states have call predecessors, (85), 73 states have call successors, (85) [2025-01-09 03:51:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 670 transitions. [2025-01-09 03:51:34,798 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 670 transitions. Word has length 115 [2025-01-09 03:51:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:34,798 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 670 transitions. [2025-01-09 03:51:34,798 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 670 transitions. [2025-01-09 03:51:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:51:34,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:34,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:34,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:51:34,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:34,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:34,801 INFO L85 PathProgramCache]: Analyzing trace with hash 873783597, now seen corresponding path program 1 times [2025-01-09 03:51:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745823421] [2025-01-09 03:51:34,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:34,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:51:34,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:51:34,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:34,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:51:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745823421] [2025-01-09 03:51:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745823421] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002337017] [2025-01-09 03:51:34,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:34,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:34,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:34,935 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:51:34,937 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:51:35,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:51:35,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:51:35,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:35,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:35,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:51:35,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:35,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:51:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002337017] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:51:35,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:51:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:51:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743943725] [2025-01-09 03:51:35,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:51:35,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:51:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:35,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:51:35,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:51:35,291 INFO L87 Difference]: Start difference. First operand 442 states and 670 transitions. Second operand has 11 states, 10 states have (on average 12.5) internal successors, (125), 11 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:51:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:35,905 INFO L93 Difference]: Finished difference Result 1229 states and 1945 transitions. [2025-01-09 03:51:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:51:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.5) internal successors, (125), 11 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 116 [2025-01-09 03:51:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:35,911 INFO L225 Difference]: With dead ends: 1229 [2025-01-09 03:51:35,912 INFO L226 Difference]: Without dead ends: 815 [2025-01-09 03:51:35,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:51:35,917 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1309 mSDsluCounter, 3853 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 4421 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:35,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 4421 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:51:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-01-09 03:51:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 791. [2025-01-09 03:51:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 624 states have (on average 1.5673076923076923) internal successors, (978), 630 states have internal predecessors, (978), 138 states have call successors, (138), 25 states have call predecessors, (138), 28 states have return successors, (159), 137 states have call predecessors, (159), 137 states have call successors, (159) [2025-01-09 03:51:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1275 transitions. [2025-01-09 03:51:35,956 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1275 transitions. Word has length 116 [2025-01-09 03:51:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1275 transitions. [2025-01-09 03:51:35,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.5) internal successors, (125), 11 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:51:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1275 transitions. [2025-01-09 03:51:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:51:35,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:35,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:35,970 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:51:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:36,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:36,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash 261167494, now seen corresponding path program 1 times [2025-01-09 03:51:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426575559] [2025-01-09 03:51:36,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:36,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:51:36,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:51:36,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:36,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:36,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426575559] [2025-01-09 03:51:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426575559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844915667] [2025-01-09 03:51:36,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:36,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:36,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:36,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:36,228 INFO L87 Difference]: Start difference. First operand 791 states and 1275 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:36,272 INFO L93 Difference]: Finished difference Result 1830 states and 3001 transitions. [2025-01-09 03:51:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:36,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-01-09 03:51:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:36,280 INFO L225 Difference]: With dead ends: 1830 [2025-01-09 03:51:36,281 INFO L226 Difference]: Without dead ends: 1117 [2025-01-09 03:51:36,284 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:51:36,284 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 112 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1124 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:51:36,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-01-09 03:51:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1109. [2025-01-09 03:51:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 878 states have (on average 1.5899772209567198) internal successors, (1396), 884 states have internal predecessors, (1396), 202 states have call successors, (202), 25 states have call predecessors, (202), 28 states have return successors, (233), 201 states have call predecessors, (233), 201 states have call successors, (233) [2025-01-09 03:51:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1831 transitions. [2025-01-09 03:51:36,334 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1831 transitions. Word has length 120 [2025-01-09 03:51:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:36,335 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1831 transitions. [2025-01-09 03:51:36,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1831 transitions. [2025-01-09 03:51:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:51:36,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:36,341 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:36,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:51:36,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 440248245, now seen corresponding path program 1 times [2025-01-09 03:51:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455312220] [2025-01-09 03:51:36,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:36,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:51:36,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:51:36,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:36,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:36,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455312220] [2025-01-09 03:51:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455312220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:36,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318322977] [2025-01-09 03:51:36,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:36,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:36,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:36,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:36,395 INFO L87 Difference]: Start difference. First operand 1109 states and 1831 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:36,453 INFO L93 Difference]: Finished difference Result 2618 states and 4352 transitions. [2025-01-09 03:51:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:36,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-01-09 03:51:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:36,464 INFO L225 Difference]: With dead ends: 2618 [2025-01-09 03:51:36,465 INFO L226 Difference]: Without dead ends: 1638 [2025-01-09 03:51:36,469 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:51:36,470 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 110 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1116 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:51:36,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-01-09 03:51:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1630. [2025-01-09 03:51:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1304 states have (on average 1.602760736196319) internal successors, (2090), 1310 states have internal predecessors, (2090), 297 states have call successors, (297), 25 states have call predecessors, (297), 28 states have return successors, (328), 296 states have call predecessors, (328), 296 states have call successors, (328) [2025-01-09 03:51:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2715 transitions. [2025-01-09 03:51:36,574 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2715 transitions. Word has length 121 [2025-01-09 03:51:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:36,574 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2715 transitions. [2025-01-09 03:51:36,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2715 transitions. [2025-01-09 03:51:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:51:36,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:36,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:36,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:51:36,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:36,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1155941300, now seen corresponding path program 1 times [2025-01-09 03:51:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48649766] [2025-01-09 03:51:36,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:36,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:51:36,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:51:36,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:36,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:36,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:36,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48649766] [2025-01-09 03:51:36,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48649766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:36,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:36,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617487416] [2025-01-09 03:51:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:36,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:36,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:36,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:36,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:36,641 INFO L87 Difference]: Start difference. First operand 1630 states and 2715 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:36,714 INFO L93 Difference]: Finished difference Result 3797 states and 6376 transitions. [2025-01-09 03:51:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-01-09 03:51:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:36,727 INFO L225 Difference]: With dead ends: 3797 [2025-01-09 03:51:36,727 INFO L226 Difference]: Without dead ends: 2427 [2025-01-09 03:51:36,732 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:51:36,733 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 108 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1111 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:51:36,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2025-01-09 03:51:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2419. [2025-01-09 03:51:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 1970 states have (on average 1.6126903553299492) internal successors, (3177), 1976 states have internal predecessors, (3177), 420 states have call successors, (420), 25 states have call predecessors, (420), 28 states have return successors, (467), 419 states have call predecessors, (467), 419 states have call successors, (467) [2025-01-09 03:51:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 4064 transitions. [2025-01-09 03:51:36,838 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 4064 transitions. Word has length 122 [2025-01-09 03:51:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:36,838 INFO L471 AbstractCegarLoop]: Abstraction has 2419 states and 4064 transitions. [2025-01-09 03:51:36,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 4064 transitions. [2025-01-09 03:51:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:51:36,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:36,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:36,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:51:36,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:36,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash -558904906, now seen corresponding path program 1 times [2025-01-09 03:51:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588217423] [2025-01-09 03:51:36,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:36,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:51:36,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:51:36,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:36,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:36,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:36,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588217423] [2025-01-09 03:51:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588217423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:36,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:36,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380655247] [2025-01-09 03:51:36,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:36,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:36,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:36,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:36,909 INFO L87 Difference]: Start difference. First operand 2419 states and 4064 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:37,048 INFO L93 Difference]: Finished difference Result 5635 states and 9533 transitions. [2025-01-09 03:51:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:37,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-01-09 03:51:37,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:37,071 INFO L225 Difference]: With dead ends: 5635 [2025-01-09 03:51:37,072 INFO L226 Difference]: Without dead ends: 3688 [2025-01-09 03:51:37,080 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:51:37,081 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 106 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1111 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:51:37,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2025-01-09 03:51:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3680. [2025-01-09 03:51:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3052 states have (on average 1.6192660550458715) internal successors, (4942), 3058 states have internal predecessors, (4942), 599 states have call successors, (599), 25 states have call predecessors, (599), 28 states have return successors, (672), 598 states have call predecessors, (672), 598 states have call successors, (672) [2025-01-09 03:51:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 6213 transitions. [2025-01-09 03:51:37,274 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 6213 transitions. Word has length 123 [2025-01-09 03:51:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:37,275 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 6213 transitions. [2025-01-09 03:51:37,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 6213 transitions. [2025-01-09 03:51:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:51:37,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:37,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:37,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:51:37,289 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -238439920, now seen corresponding path program 1 times [2025-01-09 03:51:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134935087] [2025-01-09 03:51:37,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:37,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:51:37,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:51:37,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:37,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:37,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134935087] [2025-01-09 03:51:37,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134935087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:37,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:37,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:37,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966139356] [2025-01-09 03:51:37,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:37,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:37,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:37,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:37,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:37,344 INFO L87 Difference]: Start difference. First operand 3680 states and 6213 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:37,516 INFO L93 Difference]: Finished difference Result 8661 states and 14720 transitions. [2025-01-09 03:51:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-01-09 03:51:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:37,545 INFO L225 Difference]: With dead ends: 8661 [2025-01-09 03:51:37,545 INFO L226 Difference]: Without dead ends: 5774 [2025-01-09 03:51:37,554 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:51:37,554 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 104 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1127 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:51:37,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2025-01-09 03:51:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5766. [2025-01-09 03:51:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5766 states, 4762 states have (on average 1.615497690046199) internal successors, (7693), 4768 states have internal predecessors, (7693), 975 states have call successors, (975), 25 states have call predecessors, (975), 28 states have return successors, (1092), 974 states have call predecessors, (1092), 974 states have call successors, (1092) [2025-01-09 03:51:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 9760 transitions. [2025-01-09 03:51:37,795 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 9760 transitions. Word has length 124 [2025-01-09 03:51:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:37,795 INFO L471 AbstractCegarLoop]: Abstraction has 5766 states and 9760 transitions. [2025-01-09 03:51:37,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 9760 transitions. [2025-01-09 03:51:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:51:37,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:37,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:37,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:51:37,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:37,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash 475919194, now seen corresponding path program 1 times [2025-01-09 03:51:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699998745] [2025-01-09 03:51:37,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:37,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:51:37,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:51:37,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:37,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699998745] [2025-01-09 03:51:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699998745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:37,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:37,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455073950] [2025-01-09 03:51:37,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:37,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:37,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:37,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:37,897 INFO L87 Difference]: Start difference. First operand 5766 states and 9760 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:38,077 INFO L93 Difference]: Finished difference Result 14145 states and 24089 transitions. [2025-01-09 03:51:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:38,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-01-09 03:51:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:38,127 INFO L225 Difference]: With dead ends: 14145 [2025-01-09 03:51:38,127 INFO L226 Difference]: Without dead ends: 9558 [2025-01-09 03:51:38,146 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:51:38,146 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 102 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1124 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:51:38,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9558 states. [2025-01-09 03:51:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9558 to 9550. [2025-01-09 03:51:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9550 states, 7940 states have (on average 1.6143576826196473) internal successors, (12818), 7946 states have internal predecessors, (12818), 1581 states have call successors, (1581), 25 states have call predecessors, (1581), 28 states have return successors, (1776), 1580 states have call predecessors, (1776), 1580 states have call successors, (1776) [2025-01-09 03:51:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9550 states to 9550 states and 16175 transitions. [2025-01-09 03:51:38,557 INFO L78 Accepts]: Start accepts. Automaton has 9550 states and 16175 transitions. Word has length 125 [2025-01-09 03:51:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:38,558 INFO L471 AbstractCegarLoop]: Abstraction has 9550 states and 16175 transitions. [2025-01-09 03:51:38,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 9550 states and 16175 transitions. [2025-01-09 03:51:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:51:38,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:38,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:38,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:51:38,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash 52401822, now seen corresponding path program 1 times [2025-01-09 03:51:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787363745] [2025-01-09 03:51:38,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:38,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:51:38,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:51:38,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:38,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:38,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787363745] [2025-01-09 03:51:38,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787363745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:38,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:38,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:38,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989120527] [2025-01-09 03:51:38,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:38,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:38,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:38,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:38,637 INFO L87 Difference]: Start difference. First operand 9550 states and 16175 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:39,067 INFO L93 Difference]: Finished difference Result 24616 states and 41851 transitions. [2025-01-09 03:51:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:39,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-01-09 03:51:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:39,202 INFO L225 Difference]: With dead ends: 24616 [2025-01-09 03:51:39,203 INFO L226 Difference]: Without dead ends: 16705 [2025-01-09 03:51:39,224 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:51:39,225 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 100 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1136 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:51:39,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2025-01-09 03:51:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 16697. [2025-01-09 03:51:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16697 states, 13884 states have (on average 1.6060213195044655) internal successors, (22298), 13890 states have internal predecessors, (22298), 2784 states have call successors, (2784), 25 states have call predecessors, (2784), 28 states have return successors, (3123), 2783 states have call predecessors, (3123), 2783 states have call successors, (3123) [2025-01-09 03:51:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 28205 transitions. [2025-01-09 03:51:39,812 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 28205 transitions. Word has length 126 [2025-01-09 03:51:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:39,813 INFO L471 AbstractCegarLoop]: Abstraction has 16697 states and 28205 transitions. [2025-01-09 03:51:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 28205 transitions. [2025-01-09 03:51:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:51:39,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:39,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:39,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:51:39,847 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:39,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1242642043, now seen corresponding path program 1 times [2025-01-09 03:51:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824035383] [2025-01-09 03:51:39,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:39,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:51:39,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:51:39,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:39,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:39,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824035383] [2025-01-09 03:51:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824035383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:39,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056640034] [2025-01-09 03:51:39,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:39,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:39,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:39,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:39,902 INFO L87 Difference]: Start difference. First operand 16697 states and 28205 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:40,439 INFO L93 Difference]: Finished difference Result 44152 states and 74884 transitions. [2025-01-09 03:51:40,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:40,440 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-01-09 03:51:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:40,556 INFO L225 Difference]: With dead ends: 44152 [2025-01-09 03:51:40,556 INFO L226 Difference]: Without dead ends: 29742 [2025-01-09 03:51:40,609 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:51:40,610 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 98 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1114 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:51:40,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29742 states. [2025-01-09 03:51:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29742 to 29734. [2025-01-09 03:51:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29734 states, 24882 states have (on average 1.6018808777429467) internal successors, (39858), 24888 states have internal predecessors, (39858), 4823 states have call successors, (4823), 25 states have call predecessors, (4823), 28 states have return successors, (5436), 4822 states have call predecessors, (5436), 4822 states have call successors, (5436) [2025-01-09 03:51:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29734 states to 29734 states and 50117 transitions. [2025-01-09 03:51:41,891 INFO L78 Accepts]: Start accepts. Automaton has 29734 states and 50117 transitions. Word has length 127 [2025-01-09 03:51:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:41,892 INFO L471 AbstractCegarLoop]: Abstraction has 29734 states and 50117 transitions. [2025-01-09 03:51:41,892 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 29734 states and 50117 transitions. [2025-01-09 03:51:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:51:41,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:41,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:41,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:51:41,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:41,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1972170592, now seen corresponding path program 1 times [2025-01-09 03:51:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:41,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291129067] [2025-01-09 03:51:41,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:41,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:51:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:51:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:41,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291129067] [2025-01-09 03:51:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291129067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:41,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:41,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113913595] [2025-01-09 03:51:41,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:41,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:41,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:41,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:41,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:41,971 INFO L87 Difference]: Start difference. First operand 29734 states and 50117 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:43,034 INFO L93 Difference]: Finished difference Result 81054 states and 137041 transitions. [2025-01-09 03:51:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:43,034 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-01-09 03:51:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:43,287 INFO L225 Difference]: With dead ends: 81054 [2025-01-09 03:51:43,287 INFO L226 Difference]: Without dead ends: 54382 [2025-01-09 03:51:43,362 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:51:43,363 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 96 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1125 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:51:43,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54382 states. [2025-01-09 03:51:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54382 to 54374. [2025-01-09 03:51:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54374 states, 45807 states have (on average 1.5962625799550287) internal successors, (73120), 45813 states have internal predecessors, (73120), 8538 states have call successors, (8538), 25 states have call predecessors, (8538), 28 states have return successors, (9683), 8537 states have call predecessors, (9683), 8537 states have call successors, (9683) [2025-01-09 03:51:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54374 states to 54374 states and 91341 transitions. [2025-01-09 03:51:45,467 INFO L78 Accepts]: Start accepts. Automaton has 54374 states and 91341 transitions. Word has length 128 [2025-01-09 03:51:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:45,468 INFO L471 AbstractCegarLoop]: Abstraction has 54374 states and 91341 transitions. [2025-01-09 03:51:45,468 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 54374 states and 91341 transitions. [2025-01-09 03:51:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:51:45,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:45,500 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:45,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:51:45,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:45,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1763841669, now seen corresponding path program 1 times [2025-01-09 03:51:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783231670] [2025-01-09 03:51:45,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:51:45,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:51:45,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:45,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783231670] [2025-01-09 03:51:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783231670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:45,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:45,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502331558] [2025-01-09 03:51:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:45,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:45,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:45,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:45,565 INFO L87 Difference]: Start difference. First operand 54374 states and 91341 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:47,221 INFO L93 Difference]: Finished difference Result 101591 states and 170939 transitions. [2025-01-09 03:51:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:47,222 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-01-09 03:51:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:47,727 INFO L225 Difference]: With dead ends: 101591 [2025-01-09 03:51:47,727 INFO L226 Difference]: Without dead ends: 101368 [2025-01-09 03:51:47,793 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:51:47,793 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 91 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1128 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:51:47,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101368 states. [2025-01-09 03:51:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101368 to 101360. [2025-01-09 03:51:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101360 states, 85994 states have (on average 1.589215526664651) internal successors, (136663), 86000 states have internal predecessors, (136663), 15337 states have call successors, (15337), 25 states have call predecessors, (15337), 28 states have return successors, (17528), 15336 states have call predecessors, (17528), 15336 states have call successors, (17528) [2025-01-09 03:51:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101360 states to 101360 states and 169528 transitions. [2025-01-09 03:51:51,455 INFO L78 Accepts]: Start accepts. Automaton has 101360 states and 169528 transitions. Word has length 129 [2025-01-09 03:51:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:51,456 INFO L471 AbstractCegarLoop]: Abstraction has 101360 states and 169528 transitions. [2025-01-09 03:51:51,456 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 101360 states and 169528 transitions. [2025-01-09 03:51:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:51:51,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:51,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:51,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:51:51,495 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:51,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash 673791231, now seen corresponding path program 1 times [2025-01-09 03:51:51,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:51,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40255227] [2025-01-09 03:51:51,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:51,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:51,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:51:51,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:51:51,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:51,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:52,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:52,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40255227] [2025-01-09 03:51:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40255227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:52,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:52,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:51:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492950085] [2025-01-09 03:51:52,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:52,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:51:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:51:52,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:51:52,006 INFO L87 Difference]: Start difference. First operand 101360 states and 169528 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:51:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:57,025 INFO L93 Difference]: Finished difference Result 202312 states and 343801 transitions. [2025-01-09 03:51:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 03:51:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 130 [2025-01-09 03:51:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:57,960 INFO L225 Difference]: With dead ends: 202312 [2025-01-09 03:51:57,960 INFO L226 Difference]: Without dead ends: 202095 [2025-01-09 03:51:58,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-01-09 03:51:58,058 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1782 mSDsluCounter, 6883 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 7532 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:58,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 7532 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:51:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202095 states. [2025-01-09 03:52:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202095 to 201905. [2025-01-09 03:52:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201905 states, 171351 states have (on average 1.5899294430729904) internal successors, (272436), 171255 states have internal predecessors, (272436), 30481 states have call successors, (30481), 65 states have call predecessors, (30481), 72 states have return successors, (38139), 30590 states have call predecessors, (38139), 30478 states have call successors, (38139) [2025-01-09 03:52:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201905 states to 201905 states and 341056 transitions. [2025-01-09 03:52:05,953 INFO L78 Accepts]: Start accepts. Automaton has 201905 states and 341056 transitions. Word has length 130 [2025-01-09 03:52:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:05,954 INFO L471 AbstractCegarLoop]: Abstraction has 201905 states and 341056 transitions. [2025-01-09 03:52:05,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:52:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 201905 states and 341056 transitions. [2025-01-09 03:52:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:52:06,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:06,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:06,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:52:06,023 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:06,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1535585083, now seen corresponding path program 1 times [2025-01-09 03:52:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:06,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695396208] [2025-01-09 03:52:06,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:06,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:52:06,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:52:06,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:06,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695396208] [2025-01-09 03:52:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695396208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862055505] [2025-01-09 03:52:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:06,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:06,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:06,113 INFO L87 Difference]: Start difference. First operand 201905 states and 341056 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)