./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product19.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_spec4_product19.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 f3a1dbda837d8ce3c466139238aee66f09284cf7efb22d92a7aae56a5f98c665 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:54:03,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:54:03,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:54:03,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:54:03,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:54:03,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:54:03,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:54:03,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:54:03,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:54:03,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:54:03,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:54:03,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:54:03,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:54:03,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:54:03,477 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:54:03,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:54:03,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:03,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:03,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:03,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:54:03,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:54:03,479 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 -> f3a1dbda837d8ce3c466139238aee66f09284cf7efb22d92a7aae56a5f98c665 [2025-01-09 03:54:03,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:54:03,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:54:03,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:54:03,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:54:03,751 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:54:03,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product19.cil.c [2025-01-09 03:54:04,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68ad76946/3be221d6697245fb831599fd8a78b805/FLAG28c3a2550 [2025-01-09 03:54:05,309 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:54:05,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product19.cil.c [2025-01-09 03:54:05,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68ad76946/3be221d6697245fb831599fd8a78b805/FLAG28c3a2550 [2025-01-09 03:54:05,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68ad76946/3be221d6697245fb831599fd8a78b805 [2025-01-09 03:54:05,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:54:05,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:54:05,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:05,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:54:05,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:54:05,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:05" (1/1) ... [2025-01-09 03:54:05,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6518127d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:05, skipping insertion in model container [2025-01-09 03:54:05,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:05" (1/1) ... [2025-01-09 03:54:05,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:54:05,539 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_spec4_product19.cil.c[1542,1555] [2025-01-09 03:54:05,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:05,885 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:54:05,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [57] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [98] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [136] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [502] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [802] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1018] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1319] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1336] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1434] [2025-01-09 03:54:05,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2501] [2025-01-09 03:54:05,895 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_spec4_product19.cil.c[1542,1555] [2025-01-09 03:54:05,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:06,014 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:54:06,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06 WrapperNode [2025-01-09 03:54:06,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:06,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:06,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:54:06,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:54:06,020 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:54:06" (1/1) ... [2025-01-09 03:54:06,037 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:54:06" (1/1) ... [2025-01-09 03:54:06,067 INFO L138 Inliner]: procedures = 127, calls = 185, calls flagged for inlining = 59, calls inlined = 54, statements flattened = 989 [2025-01-09 03:54:06,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:06,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:54:06,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:54:06,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:54:06,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,113 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:54:06,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:54:06,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:54:06,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:54:06,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:54:06,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (1/1) ... [2025-01-09 03:54:06,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:06,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:06,207 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:54:06,211 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:54:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:54:06,231 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:54:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:54:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:54:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:54:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:54:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:54:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:54:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:54:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:54:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:54:06,233 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:54:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:54:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:54:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:54:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:54:06,235 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:54:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:54:06,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:54:06,388 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:54:06,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:54:07,071 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-01-09 03:54:07,071 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:54:07,088 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:54:07,088 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:54:07,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:07 BoogieIcfgContainer [2025-01-09 03:54:07,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:54:07,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:54:07,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:54:07,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:54:07,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:54:05" (1/3) ... [2025-01-09 03:54:07,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f451cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:07, skipping insertion in model container [2025-01-09 03:54:07,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:06" (2/3) ... [2025-01-09 03:54:07,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f451cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:07, skipping insertion in model container [2025-01-09 03:54:07,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:07" (3/3) ... [2025-01-09 03:54:07,096 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product19.cil.c [2025-01-09 03:54:07,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:54:07,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product19.cil.c that has 18 procedures, 307 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:54:07,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:54:07,171 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;@408878d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:54:07,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:54:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 307 states, 244 states have (on average 1.528688524590164) internal successors, (373), 246 states have internal predecessors, (373), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 03:54:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:54:07,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:07,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:07,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:07,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1909031065, now seen corresponding path program 1 times [2025-01-09 03:54:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:07,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348549703] [2025-01-09 03:54:07,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:07,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:07,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:07,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:07,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348549703] [2025-01-09 03:54:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348549703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426428264] [2025-01-09 03:54:07,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:07,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:07,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:07,811 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:54:07,813 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:54:07,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:08,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:08,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:08,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:08,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:54:08,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:08,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:08,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426428264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:08,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:08,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:54:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93014512] [2025-01-09 03:54:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:08,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:54:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:08,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:54:08,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:08,127 INFO L87 Difference]: Start difference. First operand has 307 states, 244 states have (on average 1.528688524590164) internal successors, (373), 246 states have internal predecessors, (373), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:54:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:08,174 INFO L93 Difference]: Finished difference Result 461 states and 678 transitions. [2025-01-09 03:54:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:54:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 92 [2025-01-09 03:54:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:08,190 INFO L225 Difference]: With dead ends: 461 [2025-01-09 03:54:08,190 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 03:54:08,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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:54:08,198 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:08,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 03:54:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-01-09 03:54:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 238 states have (on average 1.5252100840336134) internal successors, (363), 239 states have internal predecessors, (363), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 03:54:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 450 transitions. [2025-01-09 03:54:08,251 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 450 transitions. Word has length 92 [2025-01-09 03:54:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:08,253 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 450 transitions. [2025-01-09 03:54:08,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:54:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 450 transitions. [2025-01-09 03:54:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:54:08,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:08,258 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:08,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:54:08,459 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:54:08,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:08,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash -197796993, now seen corresponding path program 1 times [2025-01-09 03:54:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571784141] [2025-01-09 03:54:08,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:08,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:08,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:08,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:08,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571784141] [2025-01-09 03:54:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571784141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721304650] [2025-01-09 03:54:08,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:08,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:08,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:08,671 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:54:08,672 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:54:08,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:08,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:54:08,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:08,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:08,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721304650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:08,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:08,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536714923] [2025-01-09 03:54:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:08,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:08,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:08,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:08,956 INFO L87 Difference]: Start difference. First operand 300 states and 450 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:54:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:08,997 INFO L93 Difference]: Finished difference Result 450 states and 659 transitions. [2025-01-09 03:54:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:08,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 92 [2025-01-09 03:54:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:09,001 INFO L225 Difference]: With dead ends: 450 [2025-01-09 03:54:09,001 INFO L226 Difference]: Without dead ends: 302 [2025-01-09 03:54:09,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:09,003 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:09,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 894 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-01-09 03:54:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2025-01-09 03:54:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 239 states have (on average 1.5230125523012552) internal successors, (364), 240 states have internal predecessors, (364), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 03:54:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 451 transitions. [2025-01-09 03:54:09,018 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 451 transitions. Word has length 92 [2025-01-09 03:54:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:09,019 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 451 transitions. [2025-01-09 03:54:09,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:54:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 451 transitions. [2025-01-09 03:54:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:54:09,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:09,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:09,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:54:09,221 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:54:09,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:09,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash 53994730, now seen corresponding path program 1 times [2025-01-09 03:54:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:09,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030966742] [2025-01-09 03:54:09,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:09,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:54:09,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:54:09,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:09,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:09,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030966742] [2025-01-09 03:54:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030966742] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145597151] [2025-01-09 03:54:09,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:09,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:09,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:09,439 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:54:09,440 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:54:09,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:54:09,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:54:09,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:09,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:09,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:09,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:09,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:09,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145597151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:09,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:09,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:09,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851435395] [2025-01-09 03:54:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:09,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:09,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:09,706 INFO L87 Difference]: Start difference. First operand 301 states and 451 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:54:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:09,739 INFO L93 Difference]: Finished difference Result 632 states and 961 transitions. [2025-01-09 03:54:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:09,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 97 [2025-01-09 03:54:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:09,743 INFO L225 Difference]: With dead ends: 632 [2025-01-09 03:54:09,745 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 03:54:09,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:09,747 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 107 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:09,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 862 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 03:54:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 349. [2025-01-09 03:54:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 276 states have (on average 1.539855072463768) internal successors, (425), 277 states have internal predecessors, (425), 55 states have call successors, (55), 17 states have call predecessors, (55), 17 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 03:54:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 534 transitions. [2025-01-09 03:54:09,778 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 534 transitions. Word has length 97 [2025-01-09 03:54:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:09,778 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 534 transitions. [2025-01-09 03:54:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:54:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 534 transitions. [2025-01-09 03:54:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:54:09,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:09,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:09,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:09,985 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:54:09,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2131921138, now seen corresponding path program 1 times [2025-01-09 03:54:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092965065] [2025-01-09 03:54:09,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:10,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:54:10,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:54:10,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:10,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:10,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092965065] [2025-01-09 03:54:10,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092965065] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:10,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786909619] [2025-01-09 03:54:10,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:10,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:10,140 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:54:10,142 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:54:10,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:54:10,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:54:10,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:10,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:10,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:54:10,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:10,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786909619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:10,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:10,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162880885] [2025-01-09 03:54:10,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:10,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:10,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:10,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:10,419 INFO L87 Difference]: Start difference. First operand 349 states and 534 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:54:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:10,489 INFO L93 Difference]: Finished difference Result 689 states and 1058 transitions. [2025-01-09 03:54:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:10,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 98 [2025-01-09 03:54:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:10,496 INFO L225 Difference]: With dead ends: 689 [2025-01-09 03:54:10,496 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 03:54:10,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 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:54:10,498 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1757 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:54:10,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1757 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 03:54:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-01-09 03:54:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 277 states have (on average 1.5379061371841156) internal successors, (426), 279 states have internal predecessors, (426), 55 states have call successors, (55), 17 states have call predecessors, (55), 18 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) [2025-01-09 03:54:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 537 transitions. [2025-01-09 03:54:10,527 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 537 transitions. Word has length 98 [2025-01-09 03:54:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:10,527 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 537 transitions. [2025-01-09 03:54:10,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:54:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 537 transitions. [2025-01-09 03:54:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:54:10,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:10,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:10,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:54:10,734 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:54:10,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:10,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash 179675402, now seen corresponding path program 1 times [2025-01-09 03:54:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:10,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808428067] [2025-01-09 03:54:10,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:54:10,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:54:10,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:10,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:10,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:10,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808428067] [2025-01-09 03:54:10,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808428067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:10,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941339287] [2025-01-09 03:54:10,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:10,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:10,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:10,911 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:54:10,912 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:54:11,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:54:11,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:54:11,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:11,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:11,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:11,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:11,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941339287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:11,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:54:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438586151] [2025-01-09 03:54:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:11,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:11,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:11,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:11,188 INFO L87 Difference]: Start difference. First operand 351 states and 537 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:54:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:11,258 INFO L93 Difference]: Finished difference Result 691 states and 1063 transitions. [2025-01-09 03:54:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:11,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 99 [2025-01-09 03:54:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:11,263 INFO L225 Difference]: With dead ends: 691 [2025-01-09 03:54:11,263 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 03:54:11,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:11,267 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 2 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1743 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:54:11,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1743 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 03:54:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-01-09 03:54:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 281 states have internal predecessors, (427), 55 states have call successors, (55), 17 states have call predecessors, (55), 19 states have return successors, (61), 54 states have call predecessors, (61), 54 states have call successors, (61) [2025-01-09 03:54:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 543 transitions. [2025-01-09 03:54:11,291 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 543 transitions. Word has length 99 [2025-01-09 03:54:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:11,292 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 543 transitions. [2025-01-09 03:54:11,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:54:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 543 transitions. [2025-01-09 03:54:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:54:11,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:11,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:11,301 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:54:11,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:11,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1843835842, now seen corresponding path program 1 times [2025-01-09 03:54:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:11,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207589854] [2025-01-09 03:54:11,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:11,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:11,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:54:11,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:54:11,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:11,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207589854] [2025-01-09 03:54:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207589854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95850856] [2025-01-09 03:54:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:11,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:11,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:11,623 INFO L87 Difference]: Start difference. First operand 353 states and 543 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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:54:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:11,664 INFO L93 Difference]: Finished difference Result 683 states and 1054 transitions. [2025-01-09 03:54:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:11,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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 100 [2025-01-09 03:54:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:11,667 INFO L225 Difference]: With dead ends: 683 [2025-01-09 03:54:11,667 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 03:54:11,669 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:54:11,669 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 2 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1761 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:54:11,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1761 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 03:54:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-01-09 03:54:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 281 states have internal predecessors, (427), 55 states have call successors, (55), 17 states have call predecessors, (55), 19 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2025-01-09 03:54:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 542 transitions. [2025-01-09 03:54:11,683 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 542 transitions. Word has length 100 [2025-01-09 03:54:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 542 transitions. [2025-01-09 03:54:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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:54:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 542 transitions. [2025-01-09 03:54:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:54:11,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:11,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:54:11,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 525069792, now seen corresponding path program 2 times [2025-01-09 03:54:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562355084] [2025-01-09 03:54:11,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:11,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-01-09 03:54:11,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 101 statements. [2025-01-09 03:54:11,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:11,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:11,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:11,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562355084] [2025-01-09 03:54:11,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562355084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:11,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:11,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:11,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201842745] [2025-01-09 03:54:11,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:11,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:11,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:11,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:11,840 INFO L87 Difference]: Start difference. First operand 353 states and 542 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:12,144 INFO L93 Difference]: Finished difference Result 716 states and 1107 transitions. [2025-01-09 03:54:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-01-09 03:54:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:12,150 INFO L225 Difference]: With dead ends: 716 [2025-01-09 03:54:12,150 INFO L226 Difference]: Without dead ends: 712 [2025-01-09 03:54:12,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:54:12,152 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 421 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:12,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 3095 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:54:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-01-09 03:54:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 701. [2025-01-09 03:54:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 554 states have (on average 1.5415162454873645) internal successors, (854), 557 states have internal predecessors, (854), 108 states have call successors, (108), 35 states have call predecessors, (108), 38 states have return successors, (122), 108 states have call predecessors, (122), 106 states have call successors, (122) [2025-01-09 03:54:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1084 transitions. [2025-01-09 03:54:12,192 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1084 transitions. Word has length 101 [2025-01-09 03:54:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:12,193 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1084 transitions. [2025-01-09 03:54:12,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1084 transitions. [2025-01-09 03:54:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:54:12,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:12,195 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:12,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:54:12,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:12,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash -637806929, now seen corresponding path program 1 times [2025-01-09 03:54:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581653734] [2025-01-09 03:54:12,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:12,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:54:12,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:54:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581653734] [2025-01-09 03:54:12,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581653734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:12,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:12,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198107503] [2025-01-09 03:54:12,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:12,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:12,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:12,296 INFO L87 Difference]: Start difference. First operand 701 states and 1084 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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:54:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:12,341 INFO L93 Difference]: Finished difference Result 1371 states and 2128 transitions. [2025-01-09 03:54:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:12,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 102 [2025-01-09 03:54:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:12,346 INFO L225 Difference]: With dead ends: 1371 [2025-01-09 03:54:12,346 INFO L226 Difference]: Without dead ends: 705 [2025-01-09 03:54:12,348 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:54:12,348 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1764 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:54:12,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1764 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-01-09 03:54:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-01-09 03:54:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 556 states have (on average 1.539568345323741) internal successors, (856), 561 states have internal predecessors, (856), 108 states have call successors, (108), 35 states have call predecessors, (108), 40 states have return successors, (125), 108 states have call predecessors, (125), 106 states have call successors, (125) [2025-01-09 03:54:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1089 transitions. [2025-01-09 03:54:12,375 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1089 transitions. Word has length 102 [2025-01-09 03:54:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:12,376 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1089 transitions. [2025-01-09 03:54:12,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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:54:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1089 transitions. [2025-01-09 03:54:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:54:12,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:12,379 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] [2025-01-09 03:54:12,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:54:12,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:12,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash 297954322, now seen corresponding path program 1 times [2025-01-09 03:54:12,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875320787] [2025-01-09 03:54:12,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:12,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:54:12,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:54:12,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875320787] [2025-01-09 03:54:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875320787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:12,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936706830] [2025-01-09 03:54:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:12,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:12,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:12,522 INFO L87 Difference]: Start difference. First operand 705 states and 1089 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:12,649 INFO L93 Difference]: Finished difference Result 1370 states and 2121 transitions. [2025-01-09 03:54:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:12,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2025-01-09 03:54:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:12,657 INFO L225 Difference]: With dead ends: 1370 [2025-01-09 03:54:12,657 INFO L226 Difference]: Without dead ends: 709 [2025-01-09 03:54:12,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:54:12,660 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 7 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:12,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3009 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-01-09 03:54:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 707. [2025-01-09 03:54:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 558 states have (on average 1.5376344086021505) internal successors, (858), 562 states have internal predecessors, (858), 108 states have call successors, (108), 36 states have call predecessors, (108), 40 states have return successors, (123), 108 states have call predecessors, (123), 106 states have call successors, (123) [2025-01-09 03:54:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1089 transitions. [2025-01-09 03:54:12,690 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1089 transitions. Word has length 103 [2025-01-09 03:54:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:12,690 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1089 transitions. [2025-01-09 03:54:12,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1089 transitions. [2025-01-09 03:54:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:54:12,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:12,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:12,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:54:12,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:12,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash -748008622, now seen corresponding path program 2 times [2025-01-09 03:54:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970531909] [2025-01-09 03:54:12,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:12,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-01-09 03:54:12,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 104 statements. [2025-01-09 03:54:12,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:12,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970531909] [2025-01-09 03:54:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970531909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644343775] [2025-01-09 03:54:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:12,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:12,802 INFO L87 Difference]: Start difference. First operand 707 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:13,087 INFO L93 Difference]: Finished difference Result 1440 states and 2238 transitions. [2025-01-09 03:54:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 03:54:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:13,095 INFO L225 Difference]: With dead ends: 1440 [2025-01-09 03:54:13,095 INFO L226 Difference]: Without dead ends: 1434 [2025-01-09 03:54:13,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:54:13,097 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 416 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:13,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 3124 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:54:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-01-09 03:54:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1411. [2025-01-09 03:54:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1114 states have (on average 1.5394973070017954) internal successors, (1715), 1124 states have internal predecessors, (1715), 212 states have call successors, (212), 72 states have call predecessors, (212), 84 states have return successors, (268), 214 states have call predecessors, (268), 208 states have call successors, (268) [2025-01-09 03:54:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2195 transitions. [2025-01-09 03:54:13,168 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2195 transitions. Word has length 104 [2025-01-09 03:54:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:13,169 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2195 transitions. [2025-01-09 03:54:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2195 transitions. [2025-01-09 03:54:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:54:13,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:13,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:13,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:54:13,174 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:13,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash 300424755, now seen corresponding path program 1 times [2025-01-09 03:54:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063371819] [2025-01-09 03:54:13,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:13,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:54:13,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:54:13,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 03:54:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063371819] [2025-01-09 03:54:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063371819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066539685] [2025-01-09 03:54:13,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:13,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:13,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:54:13,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:54:13,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:54:13,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:13,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:13,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:54:13,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066539685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:13,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792656854] [2025-01-09 03:54:13,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:13,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:13,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:13,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:13,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:13,552 INFO L87 Difference]: Start difference. First operand 1411 states and 2195 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:13,625 INFO L93 Difference]: Finished difference Result 2129 states and 3304 transitions. [2025-01-09 03:54:13,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 03:54:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:13,633 INFO L225 Difference]: With dead ends: 2129 [2025-01-09 03:54:13,633 INFO L226 Difference]: Without dead ends: 1415 [2025-01-09 03:54:13,636 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:54:13,636 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 1 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:13,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1754 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-01-09 03:54:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1407. [2025-01-09 03:54:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1112 states have (on average 1.539568345323741) internal successors, (1712), 1122 states have internal predecessors, (1712), 210 states have call successors, (210), 72 states have call predecessors, (210), 84 states have return successors, (266), 212 states have call predecessors, (266), 206 states have call successors, (266) [2025-01-09 03:54:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 2188 transitions. [2025-01-09 03:54:13,703 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 2188 transitions. Word has length 104 [2025-01-09 03:54:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:13,703 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 2188 transitions. [2025-01-09 03:54:13,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2188 transitions. [2025-01-09 03:54:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:54:13,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:13,707 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:13,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:13,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:54:13,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:13,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1334015495, now seen corresponding path program 1 times [2025-01-09 03:54:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:13,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254914848] [2025-01-09 03:54:13,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:13,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:54:13,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:54:13,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:14,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254914848] [2025-01-09 03:54:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254914848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555187708] [2025-01-09 03:54:14,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:14,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:14,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:14,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:14,018 INFO L87 Difference]: Start difference. First operand 1407 states and 2188 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:14,159 INFO L93 Difference]: Finished difference Result 2755 states and 4292 transitions. [2025-01-09 03:54:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:14,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2025-01-09 03:54:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:14,167 INFO L225 Difference]: With dead ends: 2755 [2025-01-09 03:54:14,168 INFO L226 Difference]: Without dead ends: 1415 [2025-01-09 03:54:14,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:54:14,172 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 5 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:14,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3023 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-01-09 03:54:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1411. [2025-01-09 03:54:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1116 states have (on average 1.5376344086021505) internal successors, (1716), 1125 states have internal predecessors, (1716), 210 states have call successors, (210), 73 states have call predecessors, (210), 84 states have return successors, (262), 212 states have call predecessors, (262), 206 states have call successors, (262) [2025-01-09 03:54:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2188 transitions. [2025-01-09 03:54:14,225 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2188 transitions. Word has length 105 [2025-01-09 03:54:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:14,225 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2188 transitions. [2025-01-09 03:54:14,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2188 transitions. [2025-01-09 03:54:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:54:14,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:14,229 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] [2025-01-09 03:54:14,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:54:14,229 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:14,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1931360428, now seen corresponding path program 1 times [2025-01-09 03:54:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141578608] [2025-01-09 03:54:14,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:14,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:54:14,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:54:14,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:14,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:14,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141578608] [2025-01-09 03:54:14,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141578608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:14,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307603800] [2025-01-09 03:54:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:14,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:14,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:54:14,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:54:14,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:54:14,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:14,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:14,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:54:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307603800] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:54:14,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:54:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:54:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191890933] [2025-01-09 03:54:14,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:54:14,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:54:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:14,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:54:14,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:54:14,605 INFO L87 Difference]: Start difference. First operand 1411 states and 2188 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:54:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:14,757 INFO L93 Difference]: Finished difference Result 3393 states and 5476 transitions. [2025-01-09 03:54:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:54:14,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 106 [2025-01-09 03:54:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:14,773 INFO L225 Difference]: With dead ends: 3393 [2025-01-09 03:54:14,773 INFO L226 Difference]: Without dead ends: 2795 [2025-01-09 03:54:14,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:54:14,778 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 413 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:14,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 2002 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2025-01-09 03:54:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2699. [2025-01-09 03:54:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2148 states have (on average 1.6033519553072626) internal successors, (3444), 2157 states have internal predecessors, (3444), 466 states have call successors, (466), 73 states have call predecessors, (466), 84 states have return successors, (598), 468 states have call predecessors, (598), 462 states have call successors, (598) [2025-01-09 03:54:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 4508 transitions. [2025-01-09 03:54:14,882 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 4508 transitions. Word has length 106 [2025-01-09 03:54:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 4508 transitions. [2025-01-09 03:54:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:54:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4508 transitions. [2025-01-09 03:54:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:54:14,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:14,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:14,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:54:15,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:15,098 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:15,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 666947367, now seen corresponding path program 1 times [2025-01-09 03:54:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795050406] [2025-01-09 03:54:15,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:15,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:54:15,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:54:15,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:15,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:15,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795050406] [2025-01-09 03:54:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795050406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:15,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:15,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638200363] [2025-01-09 03:54:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:15,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:15,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:15,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:15,178 INFO L87 Difference]: Start difference. First operand 2699 states and 4508 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:54:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:15,295 INFO L93 Difference]: Finished difference Result 6477 states and 10988 transitions. [2025-01-09 03:54:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:15,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 113 [2025-01-09 03:54:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:15,320 INFO L225 Difference]: With dead ends: 6477 [2025-01-09 03:54:15,321 INFO L226 Difference]: Without dead ends: 4003 [2025-01-09 03:54:15,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:15,334 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 105 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:15,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2025-01-09 03:54:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 3971. [2025-01-09 03:54:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3164 states have (on average 1.6169405815423514) internal successors, (5116), 3173 states have internal predecessors, (5116), 722 states have call successors, (722), 73 states have call predecessors, (722), 84 states have return successors, (934), 724 states have call predecessors, (934), 718 states have call successors, (934) [2025-01-09 03:54:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 6772 transitions. [2025-01-09 03:54:15,509 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 6772 transitions. Word has length 113 [2025-01-09 03:54:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:15,509 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 6772 transitions. [2025-01-09 03:54:15,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:54:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 6772 transitions. [2025-01-09 03:54:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:54:15,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:15,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:15,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:54:15,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:15,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash -324428676, now seen corresponding path program 1 times [2025-01-09 03:54:15,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158714352] [2025-01-09 03:54:15,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:15,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:54:15,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:54:15,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:15,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:15,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158714352] [2025-01-09 03:54:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158714352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:15,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002805640] [2025-01-09 03:54:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:15,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:15,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:15,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:15,574 INFO L87 Difference]: Start difference. First operand 3971 states and 6772 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:54:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:15,745 INFO L93 Difference]: Finished difference Result 9529 states and 16356 transitions. [2025-01-09 03:54:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:15,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 114 [2025-01-09 03:54:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:15,777 INFO L225 Difference]: With dead ends: 9529 [2025-01-09 03:54:15,777 INFO L226 Difference]: Without dead ends: 5987 [2025-01-09 03:54:15,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:15,791 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 103 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:15,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 892 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2025-01-09 03:54:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 5955. [2025-01-09 03:54:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5955 states, 4768 states have (on average 1.6258389261744965) internal successors, (7752), 4777 states have internal predecessors, (7752), 1102 states have call successors, (1102), 73 states have call predecessors, (1102), 84 states have return successors, (1378), 1104 states have call predecessors, (1378), 1098 states have call successors, (1378) [2025-01-09 03:54:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5955 states to 5955 states and 10232 transitions. [2025-01-09 03:54:16,051 INFO L78 Accepts]: Start accepts. Automaton has 5955 states and 10232 transitions. Word has length 114 [2025-01-09 03:54:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,051 INFO L471 AbstractCegarLoop]: Abstraction has 5955 states and 10232 transitions. [2025-01-09 03:54:16,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:54:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5955 states and 10232 transitions. [2025-01-09 03:54:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:54:16,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:16,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:54:16,078 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1870616795, now seen corresponding path program 1 times [2025-01-09 03:54:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792023736] [2025-01-09 03:54:16,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:16,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:16,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:16,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792023736] [2025-01-09 03:54:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792023736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:16,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321698477] [2025-01-09 03:54:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:16,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:16,134 INFO L87 Difference]: Start difference. First operand 5955 states and 10232 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:16,370 INFO L93 Difference]: Finished difference Result 14025 states and 24312 transitions. [2025-01-09 03:54:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 115 [2025-01-09 03:54:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:16,417 INFO L225 Difference]: With dead ends: 14025 [2025-01-09 03:54:16,418 INFO L226 Difference]: Without dead ends: 8983 [2025-01-09 03:54:16,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:16,443 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 101 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:16,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 889 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2025-01-09 03:54:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8951. [2025-01-09 03:54:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8951 states, 7272 states have (on average 1.6331133113311331) internal successors, (11876), 7281 states have internal predecessors, (11876), 1594 states have call successors, (1594), 73 states have call predecessors, (1594), 84 states have return successors, (2038), 1596 states have call predecessors, (2038), 1590 states have call successors, (2038) [2025-01-09 03:54:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 15508 transitions. [2025-01-09 03:54:16,826 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 15508 transitions. Word has length 115 [2025-01-09 03:54:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,827 INFO L471 AbstractCegarLoop]: Abstraction has 8951 states and 15508 transitions. [2025-01-09 03:54:16,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 15508 transitions. [2025-01-09 03:54:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:54:16,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:16,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:54:16,860 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2011562651, now seen corresponding path program 1 times [2025-01-09 03:54:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100341637] [2025-01-09 03:54:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:54:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:54:16,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:16,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:16,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100341637] [2025-01-09 03:54:16,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100341637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201962471] [2025-01-09 03:54:16,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:16,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:16,904 INFO L87 Difference]: Start difference. First operand 8951 states and 15508 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:54:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:17,303 INFO L93 Difference]: Finished difference Result 21017 states and 36716 transitions. [2025-01-09 03:54:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:17,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 116 [2025-01-09 03:54:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:17,374 INFO L225 Difference]: With dead ends: 21017 [2025-01-09 03:54:17,374 INFO L226 Difference]: Without dead ends: 13767 [2025-01-09 03:54:17,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:17,415 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 99 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:17,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 889 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13767 states. [2025-01-09 03:54:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13767 to 13735. [2025-01-09 03:54:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13735 states, 11340 states have (on average 1.6377425044091711) internal successors, (18572), 11349 states have internal predecessors, (18572), 2310 states have call successors, (2310), 73 states have call predecessors, (2310), 84 states have return successors, (3034), 2312 states have call predecessors, (3034), 2306 states have call successors, (3034) [2025-01-09 03:54:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13735 states to 13735 states and 23916 transitions. [2025-01-09 03:54:17,991 INFO L78 Accepts]: Start accepts. Automaton has 13735 states and 23916 transitions. Word has length 116 [2025-01-09 03:54:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 13735 states and 23916 transitions. [2025-01-09 03:54:17,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:54:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 13735 states and 23916 transitions. [2025-01-09 03:54:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:54:18,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:18,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:54:18,027 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:18,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash -790835383, now seen corresponding path program 1 times [2025-01-09 03:54:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116990963] [2025-01-09 03:54:18,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:18,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:54:18,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:54:18,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:18,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116990963] [2025-01-09 03:54:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116990963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:18,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803039751] [2025-01-09 03:54:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:18,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:18,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:18,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:18,069 INFO L87 Difference]: Start difference. First operand 13735 states and 23916 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:54:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:18,503 INFO L93 Difference]: Finished difference Result 32501 states and 57084 transitions. [2025-01-09 03:54:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:18,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:54:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:18,611 INFO L225 Difference]: With dead ends: 32501 [2025-01-09 03:54:18,612 INFO L226 Difference]: Without dead ends: 21671 [2025-01-09 03:54:18,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:18,655 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 97 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:18,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 894 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2025-01-09 03:54:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21639. [2025-01-09 03:54:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21639 states, 17740 states have (on average 1.6324689966178128) internal successors, (28960), 17749 states have internal predecessors, (28960), 3814 states have call successors, (3814), 73 states have call predecessors, (3814), 84 states have return successors, (5026), 3816 states have call predecessors, (5026), 3810 states have call successors, (5026) [2025-01-09 03:54:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21639 states to 21639 states and 37800 transitions. [2025-01-09 03:54:19,597 INFO L78 Accepts]: Start accepts. Automaton has 21639 states and 37800 transitions. Word has length 117 [2025-01-09 03:54:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:19,597 INFO L471 AbstractCegarLoop]: Abstraction has 21639 states and 37800 transitions. [2025-01-09 03:54:19,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:54:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 21639 states and 37800 transitions. [2025-01-09 03:54:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:54:19,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:19,650 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:19,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:54:19,651 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:19,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1327506039, now seen corresponding path program 1 times [2025-01-09 03:54:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:19,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791454978] [2025-01-09 03:54:19,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:19,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:54:19,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:54:19,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:19,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:19,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791454978] [2025-01-09 03:54:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791454978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:19,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34450016] [2025-01-09 03:54:19,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:19,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:19,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:19,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:19,712 INFO L87 Difference]: Start difference. First operand 21639 states and 37800 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:54:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:20,709 INFO L93 Difference]: Finished difference Result 53317 states and 93504 transitions. [2025-01-09 03:54:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:20,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:54:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:20,868 INFO L225 Difference]: With dead ends: 53317 [2025-01-09 03:54:20,869 INFO L226 Difference]: Without dead ends: 36027 [2025-01-09 03:54:20,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:20,910 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 95 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:20,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 892 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36027 states. [2025-01-09 03:54:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36027 to 35995. [2025-01-09 03:54:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35995 states, 29672 states have (on average 1.6300889727689405) internal successors, (48368), 29681 states have internal predecessors, (48368), 6238 states have call successors, (6238), 73 states have call predecessors, (6238), 84 states have return successors, (8050), 6240 states have call predecessors, (8050), 6234 states have call successors, (8050) [2025-01-09 03:54:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35995 states to 35995 states and 62656 transitions. [2025-01-09 03:54:22,151 INFO L78 Accepts]: Start accepts. Automaton has 35995 states and 62656 transitions. Word has length 118 [2025-01-09 03:54:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:22,151 INFO L471 AbstractCegarLoop]: Abstraction has 35995 states and 62656 transitions. [2025-01-09 03:54:22,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:54:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 35995 states and 62656 transitions. [2025-01-09 03:54:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:54:22,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:22,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:22,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:54:22,207 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:22,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1106736507, now seen corresponding path program 1 times [2025-01-09 03:54:22,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:22,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462486199] [2025-01-09 03:54:22,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:22,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:54:22,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:54:22,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:22,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:22,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462486199] [2025-01-09 03:54:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462486199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335542815] [2025-01-09 03:54:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:22,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:22,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:22,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:22,260 INFO L87 Difference]: Start difference. First operand 35995 states and 62656 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:54:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:23,935 INFO L93 Difference]: Finished difference Result 93101 states and 162736 transitions. [2025-01-09 03:54:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:23,935 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 119 [2025-01-09 03:54:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:24,306 INFO L225 Difference]: With dead ends: 93101 [2025-01-09 03:54:24,306 INFO L226 Difference]: Without dead ends: 63175 [2025-01-09 03:54:24,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:24,435 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 93 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:24,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63175 states. [2025-01-09 03:54:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63175 to 63143. [2025-01-09 03:54:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63143 states, 52008 states have (on average 1.620366097523458) internal successors, (84272), 52017 states have internal predecessors, (84272), 11050 states have call successors, (11050), 73 states have call predecessors, (11050), 84 states have return successors, (14274), 11052 states have call predecessors, (14274), 11046 states have call successors, (14274) [2025-01-09 03:54:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63143 states to 63143 states and 109596 transitions. [2025-01-09 03:54:26,961 INFO L78 Accepts]: Start accepts. Automaton has 63143 states and 109596 transitions. Word has length 119 [2025-01-09 03:54:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:26,962 INFO L471 AbstractCegarLoop]: Abstraction has 63143 states and 109596 transitions. [2025-01-09 03:54:26,962 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:54:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 63143 states and 109596 transitions. [2025-01-09 03:54:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:54:27,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:27,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:27,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:54:27,045 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:27,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1973687434, now seen corresponding path program 1 times [2025-01-09 03:54:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068648403] [2025-01-09 03:54:27,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:27,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:54:27,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:54:27,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:27,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068648403] [2025-01-09 03:54:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068648403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:27,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165624766] [2025-01-09 03:54:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:27,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:27,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:27,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:27,094 INFO L87 Difference]: Start difference. First operand 63143 states and 109596 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:54:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:29,866 INFO L93 Difference]: Finished difference Result 167205 states and 291632 transitions. [2025-01-09 03:54:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:29,866 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 120 [2025-01-09 03:54:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:30,563 INFO L225 Difference]: With dead ends: 167205 [2025-01-09 03:54:30,563 INFO L226 Difference]: Without dead ends: 112583 [2025-01-09 03:54:30,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:30,702 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 91 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:30,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 892 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112583 states. [2025-01-09 03:54:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112583 to 112551. [2025-01-09 03:54:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112551 states, 93260 states have (on average 1.6156551576238474) internal successors, (150676), 93269 states have internal predecessors, (150676), 19206 states have call successors, (19206), 73 states have call predecessors, (19206), 84 states have return successors, (25138), 19208 states have call predecessors, (25138), 19202 states have call successors, (25138) [2025-01-09 03:54:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112551 states to 112551 states and 195020 transitions. [2025-01-09 03:54:35,055 INFO L78 Accepts]: Start accepts. Automaton has 112551 states and 195020 transitions. Word has length 120 [2025-01-09 03:54:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:35,055 INFO L471 AbstractCegarLoop]: Abstraction has 112551 states and 195020 transitions. [2025-01-09 03:54:35,056 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:54:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 112551 states and 195020 transitions. [2025-01-09 03:54:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:54:35,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:35,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:35,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:54:35,157 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:35,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1472642887, now seen corresponding path program 1 times [2025-01-09 03:54:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:35,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282730329] [2025-01-09 03:54:35,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:35,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:54:35,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:54:35,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:35,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:35,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282730329] [2025-01-09 03:54:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282730329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:35,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666480421] [2025-01-09 03:54:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:35,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:35,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:35,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:35,209 INFO L87 Difference]: Start difference. First operand 112551 states and 195020 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:54:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:40,154 INFO L93 Difference]: Finished difference Result 306913 states and 531660 transitions. [2025-01-09 03:54:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:40,154 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 121 [2025-01-09 03:54:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:41,374 INFO L225 Difference]: With dead ends: 306913 [2025-01-09 03:54:41,374 INFO L226 Difference]: Without dead ends: 205823 [2025-01-09 03:54:41,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:41,613 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 89 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:41,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 892 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205823 states.