./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product28.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_spec9_product28.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 6fc432013ed2168eea9a323e37470d64fe5b972a8b4d9d4e2e5fdd67cd32ffed --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:58:21,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:58:21,283 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:58:21,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:58:21,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:58:21,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:58:21,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:58:21,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:58:21,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:58:21,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:58:21,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:58:21,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:58:21,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:58:21,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:58:21,319 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:58:21,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:58:21,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:58:21,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:58:21,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:58:21,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:58:21,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:58:21,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:58:21,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:58:21,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:58:21,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:58:21,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:58:21,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:58:21,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:58:21,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:21,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:21,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:21,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:58:21,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:58:21,323 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 -> 6fc432013ed2168eea9a323e37470d64fe5b972a8b4d9d4e2e5fdd67cd32ffed [2025-01-09 03:58:21,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:58:21,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:58:21,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:58:21,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:58:21,645 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:58:21,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product28.cil.c [2025-01-09 03:58:23,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c643dbc97/c894a060bc984ca4b2ec0f9ce75168bd/FLAGc4762ab54 [2025-01-09 03:58:23,419 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:58:23,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product28.cil.c [2025-01-09 03:58:23,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c643dbc97/c894a060bc984ca4b2ec0f9ce75168bd/FLAGc4762ab54 [2025-01-09 03:58:23,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c643dbc97/c894a060bc984ca4b2ec0f9ce75168bd [2025-01-09 03:58:23,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:58:23,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:58:23,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:23,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:58:23,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:58:23,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:23" (1/1) ... [2025-01-09 03:58:23,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e78069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:23, skipping insertion in model container [2025-01-09 03:58:23,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:23" (1/1) ... [2025-01-09 03:58:23,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:58:24,094 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_spec9_product28.cil.c[63802,63815] [2025-01-09 03:58:24,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:24,119 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:58:24,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2025-01-09 03:58:24,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [105] [2025-01-09 03:58:24,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [122] [2025-01-09 03:58:24,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [160] [2025-01-09 03:58:24,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [505] [2025-01-09 03:58:24,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [726] [2025-01-09 03:58:24,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1801] [2025-01-09 03:58:24,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2167] [2025-01-09 03:58:24,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2432] [2025-01-09 03:58:24,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2571] [2025-01-09 03:58:24,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2968] [2025-01-09 03:58:24,251 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_spec9_product28.cil.c[63802,63815] [2025-01-09 03:58:24,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:24,285 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:58:24,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24 WrapperNode [2025-01-09 03:58:24,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:24,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:24,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:58:24,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:58:24,294 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:58:24" (1/1) ... [2025-01-09 03:58:24,315 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:58:24" (1/1) ... [2025-01-09 03:58:24,357 INFO L138 Inliner]: procedures = 129, calls = 199, calls flagged for inlining = 56, calls inlined = 46, statements flattened = 870 [2025-01-09 03:58:24,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:24,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:58:24,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:58:24,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:58:24,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,400 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:58:24,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:58:24,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:58:24,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:58:24,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:58:24,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (1/1) ... [2025-01-09 03:58:24,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:24,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:24,511 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:58:24,515 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:58:24,544 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:58:24,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:58:24,544 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:58:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:58:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:58:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:58:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:58:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:58:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:58:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:58:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:58:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:58:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:58:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:58:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:58:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:58:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:58:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:58:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:58:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:58:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:58:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:58:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:58:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:58:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:58:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:58:24,547 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:58:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:58:24,547 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:58:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:58:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:58:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:58:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:58:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:58:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:58:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:58:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:58:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:58:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:58:24,549 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:58:24,549 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:58:24,549 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:58:24,549 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:58:24,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:58:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:58:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:58:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:58:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:58:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:58:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:58:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:58:24,779 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:58:24,781 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:58:25,756 INFO L? ?]: Removed 401 outVars from TransFormulas that were not future-live. [2025-01-09 03:58:25,756 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:58:25,778 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:58:25,779 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:58:25,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:25 BoogieIcfgContainer [2025-01-09 03:58:25,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:58:25,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:58:25,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:58:25,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:58:25,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:58:23" (1/3) ... [2025-01-09 03:58:25,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1487e4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:25, skipping insertion in model container [2025-01-09 03:58:25,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:24" (2/3) ... [2025-01-09 03:58:25,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1487e4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:25, skipping insertion in model container [2025-01-09 03:58:25,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:25" (3/3) ... [2025-01-09 03:58:25,793 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_product28.cil.c [2025-01-09 03:58:25,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:58:25,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_product28.cil.c that has 23 procedures, 327 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:58:25,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:58:25,892 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;@5c0a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:58:25,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:58:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 253 states have (on average 1.517786561264822) internal successors, (384), 257 states have internal predecessors, (384), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 03:58:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:58:25,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:25,921 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] [2025-01-09 03:58:25,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:25,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash -212290543, now seen corresponding path program 1 times [2025-01-09 03:58:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:25,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465290715] [2025-01-09 03:58:25,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:25,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:26,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:58:26,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:58:26,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:26,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:26,773 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:58:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465290715] [2025-01-09 03:58:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465290715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:26,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614594964] [2025-01-09 03:58:26,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:26,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:26,780 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:58:26,781 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:58:26,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:58:27,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:58:27,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:27,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:27,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:58:27,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:27,200 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:58:27,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614594964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:27,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:27,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:58:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75967649] [2025-01-09 03:58:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:27,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:27,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:27,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:27,239 INFO L87 Difference]: Start difference. First operand has 327 states, 253 states have (on average 1.517786561264822) internal successors, (384), 257 states have internal predecessors, (384), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:27,320 INFO L93 Difference]: Finished difference Result 508 states and 736 transitions. [2025-01-09 03:58:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:27,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-01-09 03:58:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:27,337 INFO L225 Difference]: With dead ends: 508 [2025-01-09 03:58:27,337 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 03:58:27,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:27,347 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 955 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:58:27,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 955 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 03:58:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2025-01-09 03:58:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 248 states have (on average 1.5120967741935485) internal successors, (375), 251 states have internal predecessors, (375), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:58:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 474 transitions. [2025-01-09 03:58:27,414 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 474 transitions. Word has length 98 [2025-01-09 03:58:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:27,415 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 474 transitions. [2025-01-09 03:58:27,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 474 transitions. [2025-01-09 03:58:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:58:27,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:27,421 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] [2025-01-09 03:58:27,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:27,622 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:58:27,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1704303899, now seen corresponding path program 1 times [2025-01-09 03:58:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:27,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076959434] [2025-01-09 03:58:27,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:27,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:58:27,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:58:27,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:27,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:27,966 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:58:27,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:27,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076959434] [2025-01-09 03:58:27,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076959434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:27,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755216362] [2025-01-09 03:58:27,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:27,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:27,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:27,971 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:58:27,972 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:58:28,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:58:28,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:58:28,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:28,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:28,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:58:28,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:28,314 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:58:28,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:28,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755216362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:28,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:28,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:58:28,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218901729] [2025-01-09 03:58:28,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:28,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:28,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:28,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:28,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:28,323 INFO L87 Difference]: Start difference. First operand 321 states and 474 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:28,387 INFO L93 Difference]: Finished difference Result 667 states and 999 transitions. [2025-01-09 03:58:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:28,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 03:58:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:28,394 INFO L225 Difference]: With dead ends: 667 [2025-01-09 03:58:28,396 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 03:58:28,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 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:58:28,400 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 99 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 917 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:58:28,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 917 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 03:58:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2025-01-09 03:58:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 280 states have (on average 1.5285714285714285) internal successors, (428), 283 states have internal predecessors, (428), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 03:58:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 549 transitions. [2025-01-09 03:58:28,445 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 549 transitions. Word has length 103 [2025-01-09 03:58:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:28,445 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 549 transitions. [2025-01-09 03:58:28,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 549 transitions. [2025-01-09 03:58:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:58:28,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:28,451 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] [2025-01-09 03:58:28,463 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:58:28,651 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:58:28,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:28,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -905962496, now seen corresponding path program 1 times [2025-01-09 03:58:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886685047] [2025-01-09 03:58:28,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:28,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:58:28,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:58:28,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:28,869 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:58:28,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:28,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886685047] [2025-01-09 03:58:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886685047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:28,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466070443] [2025-01-09 03:58:28,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:28,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:28,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:28,872 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:58:28,875 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:58:29,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:58:29,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:58:29,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:29,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:29,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:58:29,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:29,257 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:58:29,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466070443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:29,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:58:29,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548519827] [2025-01-09 03:58:29,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:29,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:29,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:29,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:58:29,262 INFO L87 Difference]: Start difference. First operand 364 states and 549 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:29,340 INFO L93 Difference]: Finished difference Result 719 states and 1088 transitions. [2025-01-09 03:58:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-01-09 03:58:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:29,345 INFO L225 Difference]: With dead ends: 719 [2025-01-09 03:58:29,345 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 03:58:29,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 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:58:29,350 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 2 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1849 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:58:29,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1849 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 03:58:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-01-09 03:58:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 281 states have (on average 1.5266903914590748) internal successors, (429), 285 states have internal predecessors, (429), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-01-09 03:58:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 552 transitions. [2025-01-09 03:58:29,376 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 552 transitions. Word has length 104 [2025-01-09 03:58:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:29,377 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 552 transitions. [2025-01-09 03:58:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 552 transitions. [2025-01-09 03:58:29,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:58:29,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:29,380 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] [2025-01-09 03:58:29,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:58:29,580 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:58:29,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:29,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1395804099, now seen corresponding path program 1 times [2025-01-09 03:58:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329350677] [2025-01-09 03:58:29,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:29,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:58:29,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:58:29,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:29,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:29,818 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:58:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329350677] [2025-01-09 03:58:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329350677] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183212136] [2025-01-09 03:58:29,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:29,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:29,821 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:58:29,824 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:58:29,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:58:30,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:58:30,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:30,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:30,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:58:30,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:30,155 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:58:30,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183212136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:30,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:30,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:58:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604802020] [2025-01-09 03:58:30,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:30,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:30,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:30,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:58:30,159 INFO L87 Difference]: Start difference. First operand 366 states and 552 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:30,239 INFO L93 Difference]: Finished difference Result 721 states and 1093 transitions. [2025-01-09 03:58:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:30,241 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-01-09 03:58:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:30,244 INFO L225 Difference]: With dead ends: 721 [2025-01-09 03:58:30,244 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 03:58:30,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:58:30,248 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1835 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:58:30,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 03:58:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-09 03:58:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 282 states have (on average 1.524822695035461) internal successors, (430), 287 states have internal predecessors, (430), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-01-09 03:58:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 558 transitions. [2025-01-09 03:58:30,274 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 558 transitions. Word has length 105 [2025-01-09 03:58:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:30,275 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 558 transitions. [2025-01-09 03:58:30,275 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 558 transitions. [2025-01-09 03:58:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:58:30,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:30,278 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] [2025-01-09 03:58:30,289 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:58:30,479 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:58:30,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:30,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1329885620, now seen corresponding path program 1 times [2025-01-09 03:58:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:30,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030365580] [2025-01-09 03:58:30,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:30,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:58:30,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:58:30,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:30,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:30,678 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:58:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030365580] [2025-01-09 03:58:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030365580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:30,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:30,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575380203] [2025-01-09 03:58:30,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:30,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:30,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:30,680 INFO L87 Difference]: Start difference. First operand 368 states and 558 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:30,730 INFO L93 Difference]: Finished difference Result 713 states and 1084 transitions. [2025-01-09 03:58:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:30,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-01-09 03:58:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:30,734 INFO L225 Difference]: With dead ends: 713 [2025-01-09 03:58:30,735 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 03:58:30,736 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:58:30,737 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 2 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1853 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:58:30,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1853 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 03:58:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-09 03:58:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 282 states have (on average 1.524822695035461) internal successors, (430), 287 states have internal predecessors, (430), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-01-09 03:58:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 557 transitions. [2025-01-09 03:58:30,762 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 557 transitions. Word has length 106 [2025-01-09 03:58:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:30,762 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 557 transitions. [2025-01-09 03:58:30,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 557 transitions. [2025-01-09 03:58:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:58:30,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:30,765 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] [2025-01-09 03:58:30,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:58:30,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash 892769521, now seen corresponding path program 2 times [2025-01-09 03:58:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:30,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221006869] [2025-01-09 03:58:30,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:58:30,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:30,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-01-09 03:58:30,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:58:30,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:58:30,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:30,937 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:58:30,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221006869] [2025-01-09 03:58:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221006869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:30,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:30,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278493103] [2025-01-09 03:58:30,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:30,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:30,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:30,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:30,938 INFO L87 Difference]: Start difference. First operand 368 states and 557 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:30,998 INFO L93 Difference]: Finished difference Result 711 states and 1079 transitions. [2025-01-09 03:58:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:30,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-01-09 03:58:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:31,003 INFO L225 Difference]: With dead ends: 711 [2025-01-09 03:58:31,003 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 03:58:31,004 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:58:31,006 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 2 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1839 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:58:31,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1839 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 03:58:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-09 03:58:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 282 states have (on average 1.524822695035461) internal successors, (430), 287 states have internal predecessors, (430), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (65), 60 states have call predecessors, (65), 60 states have call successors, (65) [2025-01-09 03:58:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 556 transitions. [2025-01-09 03:58:31,024 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 556 transitions. Word has length 107 [2025-01-09 03:58:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:31,025 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 556 transitions. [2025-01-09 03:58:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 556 transitions. [2025-01-09 03:58:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:58:31,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:31,027 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] [2025-01-09 03:58:31,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:58:31,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:31,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -943891300, now seen corresponding path program 3 times [2025-01-09 03:58:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640591636] [2025-01-09 03:58:31,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:58:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:31,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 3 equivalence classes. [2025-01-09 03:58:31,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 96 of 108 statements. [2025-01-09 03:58:31,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:58:31,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:31,190 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:58:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640591636] [2025-01-09 03:58:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640591636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:31,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:31,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953105530] [2025-01-09 03:58:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:31,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:31,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:31,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:31,193 INFO L87 Difference]: Start difference. First operand 368 states and 556 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:31,255 INFO L93 Difference]: Finished difference Result 713 states and 1085 transitions. [2025-01-09 03:58:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 03:58:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:31,259 INFO L225 Difference]: With dead ends: 713 [2025-01-09 03:58:31,259 INFO L226 Difference]: Without dead ends: 370 [2025-01-09 03:58:31,261 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:58:31,263 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 1 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1850 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:58:31,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1850 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-09 03:58:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-01-09 03:58:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 283 states have (on average 1.5229681978798586) internal successors, (431), 289 states have internal predecessors, (431), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (70), 60 states have call predecessors, (70), 60 states have call successors, (70) [2025-01-09 03:58:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 562 transitions. [2025-01-09 03:58:31,289 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 562 transitions. Word has length 108 [2025-01-09 03:58:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:31,289 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 562 transitions. [2025-01-09 03:58:31,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 562 transitions. [2025-01-09 03:58:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:58:31,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:31,293 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] [2025-01-09 03:58:31,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:58:31,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1728236820, now seen corresponding path program 1 times [2025-01-09 03:58:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123535204] [2025-01-09 03:58:31,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:31,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:58:31,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:58:31,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:31,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:31,466 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:58:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:31,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123535204] [2025-01-09 03:58:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123535204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:31,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:31,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:31,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739509166] [2025-01-09 03:58:31,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:31,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:31,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:31,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:31,468 INFO L87 Difference]: Start difference. First operand 370 states and 562 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:31,518 INFO L93 Difference]: Finished difference Result 719 states and 1095 transitions. [2025-01-09 03:58:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:31,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-01-09 03:58:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:31,522 INFO L225 Difference]: With dead ends: 719 [2025-01-09 03:58:31,522 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 03:58:31,524 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:58:31,524 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 1 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1856 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:58:31,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1856 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 03:58:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 03:58:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 284 states have (on average 1.5211267605633803) internal successors, (432), 291 states have internal predecessors, (432), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-01-09 03:58:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 565 transitions. [2025-01-09 03:58:31,544 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 565 transitions. Word has length 109 [2025-01-09 03:58:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:31,545 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 565 transitions. [2025-01-09 03:58:31,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 565 transitions. [2025-01-09 03:58:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:58:31,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:31,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:31,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:58:31,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:31,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:31,549 INFO L85 PathProgramCache]: Analyzing trace with hash 985546240, now seen corresponding path program 1 times [2025-01-09 03:58:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19341092] [2025-01-09 03:58:31,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:31,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:58:31,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:58:31,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:31,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:31,694 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:58:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:31,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19341092] [2025-01-09 03:58:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19341092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:31,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:31,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416967033] [2025-01-09 03:58:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:31,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:31,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:31,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:31,696 INFO L87 Difference]: Start difference. First operand 372 states and 565 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:31,743 INFO L93 Difference]: Finished difference Result 721 states and 1098 transitions. [2025-01-09 03:58:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:31,743 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-01-09 03:58:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:31,746 INFO L225 Difference]: With dead ends: 721 [2025-01-09 03:58:31,746 INFO L226 Difference]: Without dead ends: 374 [2025-01-09 03:58:31,748 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:58:31,748 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 0 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:31,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1849 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-09 03:58:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2025-01-09 03:58:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 284 states have (on average 1.5211267605633803) internal successors, (432), 291 states have internal predecessors, (432), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-01-09 03:58:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 565 transitions. [2025-01-09 03:58:31,767 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 565 transitions. Word has length 110 [2025-01-09 03:58:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:31,767 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 565 transitions. [2025-01-09 03:58:31,767 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:58:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 565 transitions. [2025-01-09 03:58:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:58:31,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:31,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:31,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:58:31,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:31,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 98323394, now seen corresponding path program 1 times [2025-01-09 03:58:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987314978] [2025-01-09 03:58:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:31,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:58:31,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:58:31,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:31,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:31,912 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:58:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987314978] [2025-01-09 03:58:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987314978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48193212] [2025-01-09 03:58:31,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:31,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:31,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:31,916 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:58:31,917 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:58:32,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:58:32,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:58:32,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:32,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:32,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:58:32,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:32,230 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:58:32,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:58:32,326 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:58:32,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48193212] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:58:32,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:58:32,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:58:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816099069] [2025-01-09 03:58:32,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:58:32,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:58:32,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:32,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:58:32,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:58:32,328 INFO L87 Difference]: Start difference. First operand 372 states and 565 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:58:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:32,496 INFO L93 Difference]: Finished difference Result 866 states and 1365 transitions. [2025-01-09 03:58:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:58:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 110 [2025-01-09 03:58:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:32,502 INFO L225 Difference]: With dead ends: 866 [2025-01-09 03:58:32,502 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 03:58:32,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:58:32,504 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 426 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:32,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1796 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:58:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 03:58:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 669. [2025-01-09 03:58:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 517 states have (on average 1.5938104448742747) internal successors, (824), 524 states have internal predecessors, (824), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-01-09 03:58:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1095 transitions. [2025-01-09 03:58:32,537 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1095 transitions. Word has length 110 [2025-01-09 03:58:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:32,537 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1095 transitions. [2025-01-09 03:58:32,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:58:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1095 transitions. [2025-01-09 03:58:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:58:32,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:32,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:32,551 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:58:32,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:58:32,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash 233305508, now seen corresponding path program 1 times [2025-01-09 03:58:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592107147] [2025-01-09 03:58:32,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:32,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:58:32,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:58:32,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:32,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:32,868 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:58:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592107147] [2025-01-09 03:58:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592107147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:32,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:32,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390947216] [2025-01-09 03:58:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:32,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:32,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:32,870 INFO L87 Difference]: Start difference. First operand 669 states and 1095 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:32,917 INFO L93 Difference]: Finished difference Result 1573 states and 2617 transitions. [2025-01-09 03:58:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-01-09 03:58:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:32,925 INFO L225 Difference]: With dead ends: 1573 [2025-01-09 03:58:32,926 INFO L226 Difference]: Without dead ends: 970 [2025-01-09 03:58:32,929 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:58:32,930 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 97 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 959 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:58:32,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-01-09 03:58:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 962. [2025-01-09 03:58:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 746 states have (on average 1.611260053619303) internal successors, (1202), 753 states have internal predecessors, (1202), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-01-09 03:58:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1611 transitions. [2025-01-09 03:58:32,990 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1611 transitions. Word has length 117 [2025-01-09 03:58:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:32,990 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1611 transitions. [2025-01-09 03:58:32,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1611 transitions. [2025-01-09 03:58:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:58:32,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:32,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:32,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:58:32,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:33,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash 454446314, now seen corresponding path program 1 times [2025-01-09 03:58:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:33,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835883927] [2025-01-09 03:58:33,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:33,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:58:33,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:58:33,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:33,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:33,079 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:58:33,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835883927] [2025-01-09 03:58:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835883927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:33,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152899144] [2025-01-09 03:58:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:33,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:33,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:33,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:33,081 INFO L87 Difference]: Start difference. First operand 962 states and 1611 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:33,139 INFO L93 Difference]: Finished difference Result 2271 states and 3829 transitions. [2025-01-09 03:58:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:33,140 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 03:58:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:33,151 INFO L225 Difference]: With dead ends: 2271 [2025-01-09 03:58:33,151 INFO L226 Difference]: Without dead ends: 1426 [2025-01-09 03:58:33,156 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:58:33,156 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 95 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 940 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:58:33,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 940 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-01-09 03:58:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1418. [2025-01-09 03:58:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1107 states have (on average 1.6233062330623307) internal successors, (1797), 1114 states have internal predecessors, (1797), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-01-09 03:58:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2396 transitions. [2025-01-09 03:58:33,275 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2396 transitions. Word has length 118 [2025-01-09 03:58:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:33,275 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2396 transitions. [2025-01-09 03:58:33,275 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2396 transitions. [2025-01-09 03:58:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:58:33,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:33,285 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:33,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:58:33,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:33,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1146671934, now seen corresponding path program 1 times [2025-01-09 03:58:33,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:33,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527288696] [2025-01-09 03:58:33,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:33,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:58:33,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:58:33,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:33,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:33,356 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:58:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:33,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527288696] [2025-01-09 03:58:33,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527288696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:33,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:33,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8762726] [2025-01-09 03:58:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:33,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:33,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:33,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:33,359 INFO L87 Difference]: Start difference. First operand 1418 states and 2396 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:33,447 INFO L93 Difference]: Finished difference Result 3290 states and 5608 transitions. [2025-01-09 03:58:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:33,448 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 03:58:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:33,463 INFO L225 Difference]: With dead ends: 3290 [2025-01-09 03:58:33,464 INFO L226 Difference]: Without dead ends: 2110 [2025-01-09 03:58:33,471 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:58:33,472 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 93 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 935 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:58:33,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2025-01-09 03:58:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2102. [2025-01-09 03:58:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2102 states, 1668 states have (on average 1.6330935251798562) internal successors, (2724), 1675 states have internal predecessors, (2724), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-01-09 03:58:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 3585 transitions. [2025-01-09 03:58:33,639 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 3585 transitions. Word has length 119 [2025-01-09 03:58:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:33,640 INFO L471 AbstractCegarLoop]: Abstraction has 2102 states and 3585 transitions. [2025-01-09 03:58:33,640 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 3585 transitions. [2025-01-09 03:58:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:58:33,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:33,653 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:58:33,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:58:33,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2020687511, now seen corresponding path program 1 times [2025-01-09 03:58:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113413296] [2025-01-09 03:58:33,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:33,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:58:33,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:58:33,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:33,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:33,745 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:58:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113413296] [2025-01-09 03:58:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113413296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:33,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118972849] [2025-01-09 03:58:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:33,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:33,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:33,749 INFO L87 Difference]: Start difference. First operand 2102 states and 3585 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:33,920 INFO L93 Difference]: Finished difference Result 4863 states and 8359 transitions. [2025-01-09 03:58:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:33,921 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 03:58:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:33,951 INFO L225 Difference]: With dead ends: 4863 [2025-01-09 03:58:33,951 INFO L226 Difference]: Without dead ends: 3196 [2025-01-09 03:58:33,962 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:58:33,962 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 91 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 935 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:58:33,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2025-01-09 03:58:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3188. [2025-01-09 03:58:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 2575 states have (on average 1.639611650485437) internal successors, (4222), 2582 states have internal predecessors, (4222), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-01-09 03:58:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 5467 transitions. [2025-01-09 03:58:34,202 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 5467 transitions. Word has length 120 [2025-01-09 03:58:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:34,203 INFO L471 AbstractCegarLoop]: Abstraction has 3188 states and 5467 transitions. [2025-01-09 03:58:34,203 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 5467 transitions. [2025-01-09 03:58:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:58:34,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:34,217 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:58:34,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:58:34,218 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:34,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1757882630, now seen corresponding path program 1 times [2025-01-09 03:58:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159021373] [2025-01-09 03:58:34,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:34,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:58:34,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:58:34,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:34,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:34,282 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:58:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159021373] [2025-01-09 03:58:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159021373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:34,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:34,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794322295] [2025-01-09 03:58:34,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:34,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:34,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:34,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:34,285 INFO L87 Difference]: Start difference. First operand 3188 states and 5467 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:34,470 INFO L93 Difference]: Finished difference Result 7704 states and 13281 transitions. [2025-01-09 03:58:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:34,471 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-01-09 03:58:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:34,508 INFO L225 Difference]: With dead ends: 7704 [2025-01-09 03:58:34,508 INFO L226 Difference]: Without dead ends: 5172 [2025-01-09 03:58:34,521 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:58:34,521 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 89 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:34,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 949 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2025-01-09 03:58:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5164. [2025-01-09 03:58:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5164 states, 4175 states have (on average 1.6332934131736527) internal successors, (6819), 4182 states have internal predecessors, (6819), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-01-09 03:58:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8860 transitions. [2025-01-09 03:58:34,878 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8860 transitions. Word has length 121 [2025-01-09 03:58:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:34,878 INFO L471 AbstractCegarLoop]: Abstraction has 5164 states and 8860 transitions. [2025-01-09 03:58:34,879 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8860 transitions. [2025-01-09 03:58:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:58:34,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:34,901 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:58:34,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:58:34,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:34,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -785264347, now seen corresponding path program 1 times [2025-01-09 03:58:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:34,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940992723] [2025-01-09 03:58:34,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:34,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:58:34,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:58:34,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:34,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:34,967 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:58:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:34,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940992723] [2025-01-09 03:58:34,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940992723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:34,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:34,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35309904] [2025-01-09 03:58:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:34,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:34,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:34,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:34,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:34,969 INFO L87 Difference]: Start difference. First operand 5164 states and 8860 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:35,295 INFO L93 Difference]: Finished difference Result 12713 states and 21946 transitions. [2025-01-09 03:58:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:35,296 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 03:58:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:35,361 INFO L225 Difference]: With dead ends: 12713 [2025-01-09 03:58:35,361 INFO L226 Difference]: Without dead ends: 8566 [2025-01-09 03:58:35,383 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:58:35,384 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 87 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 938 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:58:35,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 938 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8566 states. [2025-01-09 03:58:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8566 to 8558. [2025-01-09 03:58:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 6963 states have (on average 1.6313370673560248) internal successors, (11359), 6970 states have internal predecessors, (11359), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-01-09 03:58:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 14690 transitions. [2025-01-09 03:58:36,068 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 14690 transitions. Word has length 122 [2025-01-09 03:58:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:36,068 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 14690 transitions. [2025-01-09 03:58:36,068 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 14690 transitions. [2025-01-09 03:58:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:58:36,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:36,102 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:58:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:58:36,102 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1103256132, now seen corresponding path program 1 times [2025-01-09 03:58:36,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339927074] [2025-01-09 03:58:36,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:36,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:58:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:58:36,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:36,195 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:58:36,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339927074] [2025-01-09 03:58:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339927074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:36,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964459932] [2025-01-09 03:58:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:36,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:36,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:36,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:36,199 INFO L87 Difference]: Start difference. First operand 8558 states and 14690 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:36,655 INFO L93 Difference]: Finished difference Result 22134 states and 38133 transitions. [2025-01-09 03:58:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:36,655 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-01-09 03:58:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:36,750 INFO L225 Difference]: With dead ends: 22134 [2025-01-09 03:58:36,750 INFO L226 Difference]: Without dead ends: 14993 [2025-01-09 03:58:36,788 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:58:36,788 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 85 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 954 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:58:36,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 954 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14993 states. [2025-01-09 03:58:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14993 to 14985. [2025-01-09 03:58:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14985 states, 12187 states have (on average 1.6213177976532371) internal successors, (19759), 12194 states have internal predecessors, (19759), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-01-09 03:58:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14985 states to 14985 states and 25640 transitions. [2025-01-09 03:58:37,680 INFO L78 Accepts]: Start accepts. Automaton has 14985 states and 25640 transitions. Word has length 123 [2025-01-09 03:58:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:37,681 INFO L471 AbstractCegarLoop]: Abstraction has 14985 states and 25640 transitions. [2025-01-09 03:58:37,682 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 14985 states and 25640 transitions. [2025-01-09 03:58:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:58:37,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:37,719 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:58:37,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:58:37,719 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:37,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash -207747580, now seen corresponding path program 1 times [2025-01-09 03:58:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644651488] [2025-01-09 03:58:37,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:37,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:58:37,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:58:37,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:37,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:37,785 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:58:37,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:37,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644651488] [2025-01-09 03:58:37,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644651488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:37,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:37,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048577038] [2025-01-09 03:58:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:37,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:37,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:37,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:37,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:37,786 INFO L87 Difference]: Start difference. First operand 14985 states and 25640 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:38,762 INFO L93 Difference]: Finished difference Result 39650 states and 68136 transitions. [2025-01-09 03:58:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:38,762 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-01-09 03:58:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:38,953 INFO L225 Difference]: With dead ends: 39650 [2025-01-09 03:58:38,953 INFO L226 Difference]: Without dead ends: 26660 [2025-01-09 03:58:39,029 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:58:39,030 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 83 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 938 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:58:39,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 938 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26660 states. [2025-01-09 03:58:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26660 to 26652. [2025-01-09 03:58:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26652 states, 21815 states have (on average 1.6165024066009626) internal successors, (35264), 21822 states have internal predecessors, (35264), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-01-09 03:58:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26652 states to 26652 states and 45497 transitions. [2025-01-09 03:58:40,557 INFO L78 Accepts]: Start accepts. Automaton has 26652 states and 45497 transitions. Word has length 124 [2025-01-09 03:58:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:40,557 INFO L471 AbstractCegarLoop]: Abstraction has 26652 states and 45497 transitions. [2025-01-09 03:58:40,557 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 26652 states and 45497 transitions. [2025-01-09 03:58:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:58:40,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:40,600 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:58:40,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:58:40,600 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:40,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1822801698, now seen corresponding path program 1 times [2025-01-09 03:58:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710960646] [2025-01-09 03:58:40,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:40,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:58:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:58:40,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:40,671 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:58:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710960646] [2025-01-09 03:58:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710960646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:40,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:40,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023218959] [2025-01-09 03:58:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:40,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:40,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:40,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:40,674 INFO L87 Difference]: Start difference. First operand 26652 states and 45497 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:42,114 INFO L93 Difference]: Finished difference Result 72602 states and 124368 transitions. [2025-01-09 03:58:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:42,115 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-01-09 03:58:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:42,389 INFO L225 Difference]: With dead ends: 72602 [2025-01-09 03:58:42,389 INFO L226 Difference]: Without dead ends: 48640 [2025-01-09 03:58:42,491 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:58:42,492 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 81 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 942 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:58:42,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 942 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48640 states. [2025-01-09 03:58:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48640 to 48632. [2025-01-09 03:58:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48632 states, 40080 states have (on average 1.610179640718563) internal successors, (64536), 40087 states have internal predecessors, (64536), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-01-09 03:58:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48632 states to 48632 states and 82731 transitions. [2025-01-09 03:58:44,978 INFO L78 Accepts]: Start accepts. Automaton has 48632 states and 82731 transitions. Word has length 125 [2025-01-09 03:58:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:44,979 INFO L471 AbstractCegarLoop]: Abstraction has 48632 states and 82731 transitions. [2025-01-09 03:58:44,979 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 48632 states and 82731 transitions. [2025-01-09 03:58:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:58:45,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:45,033 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:58:45,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:58:45,033 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1723771036, now seen corresponding path program 1 times [2025-01-09 03:58:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691484830] [2025-01-09 03:58:45,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:45,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:58:45,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:58:45,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:45,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:45,102 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:58:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691484830] [2025-01-09 03:58:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691484830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:45,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647469000] [2025-01-09 03:58:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:45,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:45,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:45,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:45,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:45,105 INFO L87 Difference]: Start difference. First operand 48632 states and 82731 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:47,677 INFO L93 Difference]: Finished difference Result 90569 states and 154411 transitions. [2025-01-09 03:58:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:47,677 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-01-09 03:58:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:48,211 INFO L225 Difference]: With dead ends: 90569 [2025-01-09 03:58:48,211 INFO L226 Difference]: Without dead ends: 90396 [2025-01-09 03:58:48,271 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:58:48,271 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 76 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 944 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:58:48,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 944 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90396 states. [2025-01-09 03:58:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90396 to 90388. [2025-01-09 03:58:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90388 states, 75037 states have (on average 1.6023295174380638) internal successors, (120234), 75044 states have internal predecessors, (120234), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-01-09 03:58:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90388 states to 90388 states and 153073 transitions. [2025-01-09 03:58:52,643 INFO L78 Accepts]: Start accepts. Automaton has 90388 states and 153073 transitions. Word has length 126 [2025-01-09 03:58:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:52,643 INFO L471 AbstractCegarLoop]: Abstraction has 90388 states and 153073 transitions. [2025-01-09 03:58:52,643 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:58:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 90388 states and 153073 transitions. [2025-01-09 03:58:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:58:52,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:52,690 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:58:52,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:58:52,690 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:52,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 703884995, now seen corresponding path program 1 times [2025-01-09 03:58:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104372049] [2025-01-09 03:58:52,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:52,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:58:52,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:58:52,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:52,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:53,238 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:58:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104372049] [2025-01-09 03:58:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104372049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:53,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:58:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111011916] [2025-01-09 03:58:53,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:53,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:58:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:53,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:58:53,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:58:53,242 INFO L87 Difference]: Start difference. First operand 90388 states and 153073 transitions. Second operand has 13 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:58:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:58,044 INFO L93 Difference]: Finished difference Result 180331 states and 310821 transitions. [2025-01-09 03:58:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 03:58:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 127 [2025-01-09 03:58:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:59,193 INFO L225 Difference]: With dead ends: 180331 [2025-01-09 03:58:59,193 INFO L226 Difference]: Without dead ends: 180166 [2025-01-09 03:58:59,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:58:59,308 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 1400 mSDsluCounter, 5220 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 5763 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:59,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 5763 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 03:58:59,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180166 states. [2025-01-09 03:59:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180166 to 180071. [2025-01-09 03:59:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180071 states, 149562 states have (on average 1.6031411722228908) internal successors, (239769), 149466 states have internal predecessors, (239769), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2025-01-09 03:59:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180071 states to 180071 states and 308306 transitions. [2025-01-09 03:59:07,636 INFO L78 Accepts]: Start accepts. Automaton has 180071 states and 308306 transitions. Word has length 127 [2025-01-09 03:59:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:07,636 INFO L471 AbstractCegarLoop]: Abstraction has 180071 states and 308306 transitions. [2025-01-09 03:59:07,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:59:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 180071 states and 308306 transitions. [2025-01-09 03:59:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:59:07,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:07,728 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:59:07,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:59:07,728 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:07,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash 349616637, now seen corresponding path program 1 times [2025-01-09 03:59:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223560758] [2025-01-09 03:59:07,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:07,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:59:07,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:59:07,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:07,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:07,928 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:59:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223560758] [2025-01-09 03:59:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223560758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:07,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:59:07,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550911011] [2025-01-09 03:59:07,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:07,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:59:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:07,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:59:07,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:59:07,930 INFO L87 Difference]: Start difference. First operand 180071 states and 308306 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 8 states have internal predecessors, (89), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12)